栈的链式存储结构操作及实现

栈的链式存储结构操作及实现

/*栈的链式存储结构操作及实现 */ #include<iostream>#include<cstdio>#include<cstring>#include<stdlib.h>using namespace std;typedef int SElemType; //这里用int示例typedef struct StackNode //节点的定义 {SElemType data;struct StackNode *next;}StackNode,*LinkStackPtr;typedef struct LinkStack //栈结构的定义 {LinkStackPtr top;int count;}LinkStack;int StackEmpty(LinkStack *S){if(S->top==NULL) return 1;else return 0;}void Push(LinkStack *S,SElemType e){LinkStackPtr p=(LinkStackPtr)malloc(sizeof(StackNode));p->data=e;p->next=S->top;S->top=p;S->count++;}int Pop(LinkStack *S,SElemType &e){LinkStackPtr p;if(StackEmpty(S)) return 0;e=S->top->data;p=S->top;S->top=S->top->next;free(p);S->count--;return 1;}int main(){int flag;SElemType a,b; LinkStack sta;sta.top=NULL;cout<<"请压入元素,输入0结束"<<endl;while(cin>>a&&a){Push(&sta,a);cout<<"成功压入( ⊙o ⊙)"<<endl;cout<<"现在栈顶是：";cout<<sta.top->data<<endl; } cout<<"是否弹栈？弹请选择1,否则选2结束"<<endl;cout<<"1.弹   2.不弹,结束"<<endl;while(cin>>a&&a==1){ flag=Pop(&sta,b);if(flag)cout<<"成功弹出了"<<b<<endl;else {cout<<"栈空了，再见"<<endl; break;}}return 0;}