链栈 Link Stack

/*stack class declarations;*/#ifndef _STACK_H_#define _STACK_H_#include <iostream>using namespace std;typedef intElemType;typedef struct SNode{ElemTypedata;struct SNode*pNext;}Node;class CStack{public:CStack();boolPush(ElemType elem);//push: insert an element to stack's topboolPop(ElemType& elem);//pop : delete an element on stack's topintitsLength();//get stack's length;voidTraverse();~CStack();private:Node*top;Node*base;};#endif // _STACK_H_

 

/*class stack's definition;*/#include "stack.h"/*Parameter:noneReturn:noneDescription:*/CStack::CStack() {cout<<"[class default constructor.]"<<endl;base=NULL;top=NULL;} // class default constructor/*Parameter:ElemTypeReturn:true or falseDescription:*/bool CStack::Push(ElemType elem) {Node*pNode=new Node;pNode->data=elem;pNode->pNext=top;top=pNode;return true;} // Push/*Parameter:ElemType&Return:true or falseDescription:*/boolCStack::Pop(ElemType& elem) {elem=top->data;top=top->pNext;return true;} // Pop/*Parameter:noneReturn:noneDescription:visit stack*/voidCStack::Traverse() {Node*peak=top;while(peak) {cout<<"element : "<<peak->data<<endl;peak=peak->pNext;}} // Traverse/*Parameter:noneReturn:stack lengthDescription:*/intCStack::itsLength() {intiLen=0;Node*peak=top;while(peak) {++iLen;peak=peak->pNext;}returniLen;} // itsLength/*Parameter:noneReturn:noneDescription:*/CStack::~CStack() {cout<<"[class default destructor. ]"<<endl;} // class default destructor

 

//------------------------------------------------------------------------------//Copyright (c) 2009 eryar All rights reserved.////File:Main.cpp//Author:[e-mail]//Date:2009-12-31//Version:1.0v////Description:////==============================================================================#include "stack.h"int main(int argc, char* argv[]){intiData;CStackstack;for (int i = 1; i < 10; ++i) {stack.Push(i);}cout<<"current length : "<<stack.itsLength()<<endl;stack.Traverse();cout<<"================================="<<endl;cout<<"after pop 5 elements out : "<<endl;for (i = 1; i < 5; ++i) {stack.Pop(iData);}cout<<"current length : "<<stack.itsLength()<<endl;stack.Traverse();return 0;}