스택 구현

 

class Stack
{
private:
	int *stack;
	int top;
	int capacity;
public:
	Stack(int Capacity = 1000);
	int IsEmpty()const;
	int &Top()const;
	void Push(const int &item);
	void Pop();
};
Stack::Stack(int stackCapacity) : capacity(stackCapacity)
{
	stack = new Int[capacity];
	top = -1;
}
int Stack::IsEmpty() const
{
	if (top == -1) return 1;
	else return 0;
}
int & Stack::Top() const
{
	return stack[top];
}
void Stack::Push(const int & item)
{
	stack[++top] = x;
}
void Stack::Pop()
{
	top--;
}