Hacktoberfest-2021/StackUsingArrays.cpp at master · paramarora09/Hacktoberfest-2021 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <iostream>
using namespace std;

class StackUsingArray {
    int *data;
    int nextIndex;
    int capacity;

    public:
    StackUsingArray(int totalsize) {
        data=new int[totalsize];
        nextIndex=0;
        capacity=totalsize;
    }


bool isEmpty() {
    if(nextIndex==0)
        return true;

    else
        return false;

}

int size() {
    return nextIndex;
}

void push(int element) {
    if(nextIndex==capacity) {
        cout<<"Stack is full";
        return;
    }

    data[nextIndex]= element;
    nextIndex++;
}

int pop() {
    if(isEmpty()){
        cout<<"Stack is empty";
        return 0;
    }

    nextIndex--;
    return data[nextIndex];
}

int top() {
    return data[nextIndex -1];
}
};
int main() {
    StackUsingArray s(4);
    s.push(10);
    s.push(20);
    s.push(30);
    s.push(40);
    cout<<endl;
    cout<<s.isEmpty();
    cout<<endl;
    cout<<s.size();
    cout<<endl;
    cout<<s.top();
    cout<<endl;
    cout<<s.pop();

    return 0;
}