c語言棧的各種基本運(yùn)算代碼

少年易學(xué)老難成，一寸光陰不可輕?少年易學(xué)老難成，一寸光陰不可輕?百度文庫#題目：實(shí)現(xiàn)順序棧的各種基本運(yùn)算，并在此基礎(chǔ)上設(shè)計一個主程序完成如下功能:(I)初始化棧S；⑵判斷棧S是否為空；(3)依次使元素a,b,c,d,e進(jìn)棧；⑷判斷棧S是否為空；⑸輸出棧的長度；(6)輸出從棧頂?shù)綏５自兀?7)輸出出棧序列；(8)判斷順序棧S是否為空；(9)釋放棧代碼；#iiiclude<stdio.h>#mclude<malloc.h>#defineMaxSize50typedefcharElemType;typedefstiuct(ElemTypedata[MaxSize];inttop; 〃棧頂指針JSqStack;〃順序棧頂類型定義〃初始化棧voidInitStack(SqStack*&s)(s=(SqStack*)malloc(sizeof(SqStack));s->top=-l;}〃銷毀棧voidCleaiStack(SqStack*&s)(free(s);}〃求棧的長度mtStackLength(SqStack*s)(retuin(s->top+l);)〃判斷棧是否為空mtStackEmpty(SqStack*s)retuin(s->top=-1);}〃進(jìn)棧mtPush(SqStack*&s,ElemTypee)(if(s->top=MaxSize-1)return0;s->top-H-;s->data[s->top]=e;return1;}〃出棧mtPop(SqStack*&s,ElemType&e)(if(s->top=-l)return0;e=s->data[s->top];s->top-;return1;}//取出棧頂元素mtGetTop(SqStack*s,ElemType&e)(if(s->top=-l)return0;e=s->data[s->top];return1;}〃顯示棧中元素voidDispStack(SqStack*s)(mti;fdr(i=s->top;i>=0;i-)prmtf(H%cH,s->data[i]);pnntfC，\nM);}mtmam()(ElemTypee;SqStack*s;pnntfC初始化棧s\n”);IiutStack(s);pnntf(”棧S為%s\n”，(StackEmpty(s)?”空H:“非空"));pHntf("一次進(jìn)棧元素a,b,c,d,e;\n");Push(s,4)；Push(s,'b');Push(s；c);Push(s；d);Push(s；e);pnntf("棧S為％$\11"，(StackEmpty(s)?"空":“非空"));pHntf("輸出棧長度S=%d：\nf,,StackLength(s));pnntf("輸出從棧頂?shù)綏５椎脑兀?)；DispStack(s);GetTop(s,e);pHntf("顯示棧頂元素：%c",e);pnntfC，")；pnntf("輸出出棧序列：)while(?StackEmpty(s))(Pop(s,e);pnntf(”%c”,e);}pnntf(”棧S為%s\n”,