stksequence.h

自己写的堆栈算法

#include <assert.h>

template <class Type> class Stack{
private:
	int top;
	Type *elements;
	int MaxSize;
public:
	Stack(int=10);
	~Stack(){delete[] elements;}
	void Push(const Type &item);
	Type Pop();
	Type GetTop();
	void MakeEmpty(){top=-1;}
	int IsEmpty() const{return top == -1;}
	int IsFull() const{return top == MaxSize-1;}
};