c语言栈的几种方法应用.doc

这事c语言栈的几种方法的应用，希望有助于大家学习c#include stdio.h#includestdlib.h#includestring.h#define MAXNUM 20#define ElemType int /*定义顺序栈的存储结构*/typedef struct ElemType stackMAXNUM; int top;SqStack;/*初始化顺序栈*/void InitStack(SqStack *p)if(!p) printf(内存分配失败!);p-top=-1;/*入栈*/void Push(SqStack *p,ElemType x) if(p-toptop=p-top+1; p-stackp-top=x; else printf(Overflow! n);/*出栈*/ElemType Pop(SqStack *p) ElemType x; if(p-top=0) x=p-stackp-top; printf(以前的栈顶数据元素%d已经被删除! n,p-stackp-top); p-top=p-top-1; return x; else printf(Underflow! n); return(0); /*获取栈顶元素*/ElemType GetTop(SqStack *p)ElemType x;if(p-top=0)x=p-stackp-top;printf(n栈顶元素为：%dn,x);return x;elseprintf(Underflow! n);return 0;/*遍历顺序栈*/void OutStack(SqStack *p)int i;printf(n);if(p-toptop;i=0;i-) printf(第%d个数据元素是：%6dn,i,p-stacki);/括号匹配void Pop2(SqStack *p) ElemType x; if(p-top=0) x=p-stackp-top; p-top=p-top-1; void match()SqStack *s;int i=0,flag=1;char c20;getchar();printf(请输入括号和*n);gets(c);s=(SqStack *)malloc(sizeof(SqStack);InitStack(s);while(itop=-1)printf(缺少左括号(n);flag=0;if(s-top!=-1&s-stacks-top=()Pop2(s);break;case:if(s-top=-1)printf(缺少左括号n);flag=0;if(s-top!=-1&s-stacks-top=)Pop2(s);break;case:if(s-top=-1)printf(缺少左括号n);flag=0;if(s-top!=-1&s-stacks-top=)Pop2(s);break;i+;if(s-top=-1&flag)printf(匹配成功n);if(s-top!=-1) printf(%c括号匹配错误，缺少其右括号n,s-stacks-top);/进制转换ElemType Pop1(SqStack *p) ElemType x; if(p-top=0) x=p-stackp-top; p-top=p-top-1; return x; else printf(Underflow! n); return(0); void zhuanhuan()SqStack *s;char a20;int n,number;printf(请输入10进制数字n);scanf(%d,&number);printf(请输入需要转换的进制：n);scanf(%d,&n);s=(SqStack *)malloc(sizeof(SqStack);InitStack(s);while(number)Push(s,number%n);number/=n;printf(转换成%d进制为 ：n,n);while(s-top!=-1)if(n10&s-stacks-top9)printf(%c,Pop1(s)-10+A);else printf(%d,Pop1(s);printf(n);/*主函数*/void main()SqStack *q;int cord;ElemType a; printf(第一次使用必须初始化! n); do printf(n); printf(n-主菜单- n); printf(n 1 初始化顺序栈 n); printf(n 2 插入一个元素 n); printf(n 3 删除栈顶元素 n); printf(n 4 取栈顶元素 n); printf(n 5 置空顺序栈 n); printf(n 6 结束程序运行 n); printf(n 7 括号匹配 n); printf(n 8 进制转换 n); printf(n- n); printf(请输入你的选择(1，2，3，4，5，6,7,8); scanf(%d,&cord); printf(n); switch(cord) case 1: q=(SqStack*)malloc(sizeof(SqStack); InitStack(q); OutStack(q); break; case 2: printf(请输入要插入的数据元素：a=); scanf(%d,&a); Push(q,a); OutStack(q); break; case 3: Pop(q); OutStack(q); break; case 4: GetTop(q); OutStack(q); break; case 5: