王道c语言-chap13 栈实例

#include <iostream>#define END -1
#define MaxSize 50typedef int ElemType;
typedef struct {int data[MaxSize];int top;
} SqStack;void InitStack(SqStack &s) {s.top=-1;
}void PrinfSqStack(SqStack s) {for (int i = 0; i <= s.top; ++i) {printf("%d   ", s.data[i]);}printf("\n");
}bool Pop(SqStack &s,ElemType &m) {if (-1 == s.top) {return false;}m = s.data[s.top--];return true;
}bool Push(SqStack &s, ElemType n) {if (MaxSize - 1 == s.top) {return false;}s.data[++s.top] = n;return true;
}
bool StackEmpty(SqStack S){if(-1==S.top){return true;} else{return false;}
}bool GetTop(SqStack S,ElemType &m){if (StackEmpty(S)){return false;} else{m=S.data[S.top--];return true;}
}int main() {SqStack S;InitStack(S);bool flag;flag = StackEmpty(S);if(flag){printf("Stack is empty.\n");}Push(S, 3);Push(S, 4);Push(S, 5);PrinfSqStack(S);ElemType m; //存放元素flag = GetTop(S,m);if(flag){printf("top element of stack is %d .\n",m);}flag = Pop(S,m);if(flag){printf("pop element of stack is %d .\n",m);}PrinfSqStack(S);return 0;
}