C++模板实现顺序栈

 template class SeqStack{ public: SeqStack(int sz):m_ntop(-1),m_nMaxSize(sz){ m_pelements=new Type[sz]; if(m_pelements==NULL){ cout<<"Application Error!"< void SeqStack::Push(const Type item){ if(IsFull()){ cout<<"The stack is full!"< Type SeqStack::Pop(){ if(IsEmpty()){ cout<<"There is no element!"< Type SeqStack::GetTop() const{ if(IsEmpty()){ cout<<"There is no element!"< void SeqStack::Print(){ cout<<"bottom"; for(int i=0;i<=m_ntop;i++){ cout<<"--->"<top"<

 #include using namespace std; #include "SeqStack.h" int main(){ SeqStack stack(10); int init[10]={1,2,6,9,0,3,8,7,5,4}; for(int i=0;i<10;i++){ stack.Push(init[i]); } stack.Print(); stack.Push(88); cout<