스택

#include <iostream>

using namespace std;

class Stacks {
	int top, maxsize;
	int *stack;

public:
	Stacks(int size) {
		maxsize = size;
		stack = new int[maxsize];
		top = -1;
	}
	bool isFull() {
		if (top == maxsize - 1)
			return true;
		else
			return false;
	}
	bool isEmpty() {
		if (top == -1)
			return true;
		else
			return false;
	}
	int pop() {
		if (!isEmpty())
		{
			int tmp = stack[top];
			top--;
			return tmp;
		}

	}
	void push(int element) {
		if (!isFull())
		{
			top++;
			stack[top] = element;
		}
		else
			cout << "꽉참";
	}

};

int main(void)
{
	Stacks A(100);
	A.push(2);
	A.push(3);
	A.push(4);
	cout << A.pop() << endl;
	cout << A.pop() << endl;
	cout << A.pop() << endl;
	return 0;
}