顺序栈

源代码

# ifndef SeqStack_H
# define SeqStack_H
const int StackSize=10;
template <class DataType>
class SeqStack
{
	public:
		SeqStack();
		~SeqStack(){};
		void Push (DataType x);
		DataType Pop();
		DataType GetTop();
		int Empty();
	private:
		DataType data[StackSize];
		int top;
};
# endif

# include "SeqStack.h"

template <class DataType>
SeqStack<DataType>::SeqStack()
{
	top=-1;
}

template <class DataType>
void SeqStack<DataType>::Push(DataType x)
{
	if (top==StackSize-1)throw"上溢";
	top++;
	data[top]=x;}

template<class DataType>
DataType SeqStack<DataType>::Pop()
{
	DataType x;
	if(top==-1)throw"下溢";
	x=data[top--];
	return x;
}

template<class DataType>
DataType SeqStack<DataType>::GetTop()
{
	if(top!=-1)
	return data[top];
}

template<class DataType>
int SeqStack<DataType>::Empty()
{
	if(top==-1)return 1;
	else return 0;
}

# include<iostream>
using namespace std;
# include "SeqStack.cpp"

void main()
{
	SeqStack<int>S;
	if(S.Empty())
		cout<<"栈为空"<<endl;
	else 
		cout<<"栈非空"<<endl;
	cout<<"对5和3执行入栈操作"<<endl;
	S.Push( 5);
	S.Push(3);
	cout<<"栈顶元素为："<<endl;
	cout<<S.GetTop()<<endl;
	cout<<"执行一次出栈的操作"<<endl;
	S.Pop();
    cout<<"栈顶元素为："<<endl;
	cout<<S.GetTop()<<endl;
}

运行结果截图