//=============================
//張邦華 2005160103
//實現簡單棧的機制
//Stack.h
//=============================

#ifndef HEADER_STACK
#define HEADER_STACK
#include <iostream>
using namespace std;

class Stack
{
	vector<char> vStack;
public:
	void Pop(char &x)//出棧
	{
		if(vStack.size()==0)
			cout<<"Stack is empty!\n";
		else
		{
			x=vStack[vStack.size()-1];
			vStack.pop_back();
		}
	}
	void Push(char x)//壓棧
	{
		if(vStack.size()==30)
			cout<<"Stack is full!\n";
		else
			vStack.push_back(x);
	}
	void Seeing()//查看棧中內容
	{
		if(vStack.size()==0)
			cout<<"Stack is empty!\n";
		else
		for(int i=0;i<vStack.size();i++)
			cout<<vStack[i];
		cout<<endl;
	}
};
#endif