頭文件LinkStack.h #ifndef?LINKSTACK_H //如果沒(méi)有定義該?頭文件，就執(zhí)行以下的（define）,否則就直接endif(避免二次調(diào)用 #define?LINKSTACK_H template<class?DataType>????????//模板類(lèi) class?LinkStack?????????????????//鏈棧定義 { public: LinkStack();?????????????????????????????//構(gòu)造函數(shù) ~LinkStack();???????????????//析構(gòu)函數(shù) void?Push(DataType?x);???????????????????//入棧，增加 DataType?Pop();?????????????//出棧，刪除 DataType?GetTop();??????????????????????//取棧頂元素，不刪除 int?Empty();????????????????//判空 private: Node<DataType>?*top?????????//棧頂指針 }; #endif 源文件LinkStack.cpp #include<iostream> using?namespace?std; #include?"LinkStack.h"?????????????????????????????//包含頭文件 template<class?DataType> LinkStack<DataType>::LinkStack()??????????????????// { top=NULL;?????????????????????????????????????//棧頂指針初始化為空 } template<class?DataType> LinkStack<DataType>::~LinkStack()?????????????????//析構(gòu)函數(shù) { } template<class?DataType> void?LinkStack<DataType>::Push(DataType?x) { s=new?Node;???s->data=x; ?//申請(qǐng)一個(gè)數(shù)據(jù)域?yàn)閤的節(jié)點(diǎn)s，next指向 s->next=top;??top=s; ?//將節(jié)點(diǎn)s插在棧頂 } template<class?DataType> DataType?LinkStack<DataType>::Pop() ????? { if(top==NULL)?throw?"下溢";?????????????????// x=top->data;?p=top; top=top->next; delete?p; return?x; } template<class?DataType> DataType?GetTop() { if(top！=?NULL)??????????????????????????????//不刪除 return?top->data; } template<class?DataType> int?Empty() { top==NULL???return?1:return?0; } 主函數(shù)文件LinkStackMain.cpp #include<iostream> using?namespace?std; #include"LinkStack.cpp" void?main() { LinkStack<int>?L;???????????????????????????//實(shí)例化類(lèi)對(duì)象 if(L.Empty()==1) //判空 cout<<"棧為空"<<endl; else?cout<<"棧為非空"<<endl; L.Push(2);?????????????????????????????????//依次入棧 L.Push(3); cout<<"棧頂元素為："<<L.GetTop()<<endl;????//取棧頂元素 //cout<<"出棧："<<L.Pop()<<endl;??? cout<<"出棧："<<endl; L.Pop(); cout<<"棧頂元素為："<<L.GetTop()<<endl;????//出棧一次，棧頂元素改變 system("pause"); }