DSalgorithm/stackArr.cpp at master · Nickhil1737/DSalgorithm · 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

#include<bits/stdc++.h>
using namespace std;

/***************************************ORIGINAL aUTHOR*******************************
 *************************************************************************************
 *************************************************************************************
 *************astrainL3gi0N**********************************************************/

class stac
{
	int *S;
	int n;
	int top = -1;
	public:

	stac(int n){
		S = new int[n];
		this->n = n;
	}

	void push(int item){
		if( top >= n-1){
			cout<<"overflow\n";
			return;
		}
		S[++top] = item;
	}
	int pop(){
		if(top == -1){
			cout<<"underflow\n";
			return -1;
		}
		return S[top--];
	}
};

int main()
{

	int n;	cin>>n;
	stac S(n);

	for(int i = 0; i <= n; ++i){
		int k;	cin>>k;
		S.push(k);
	}
	for(int i = 0; i <= n; ++i)
		cout<<S.pop()<<' ' ;


	return 0;

}