順序棧的各種基本運(yùn)算,準(zhǔn)確無誤版

1、順序棧的各種基本運(yùn)算實(shí)驗(yàn)內(nèi)容與要求：編寫一個程序，實(shí)現(xiàn)順序棧的各種基本運(yùn)算，并在基礎(chǔ)上完成以下功能:1 初始化順序棧；2 判斷順序棧是否為空；3 依次進(jìn)棧元素a,b,c,d,e；4 判斷順序棧是否為空；5 輸出棧長度；6 輸出從棧頂?shù)綏５椎脑兀? 讀出棧頂元素；8 刪除棧頂元素；9 輸出從棧頂?shù)綏５椎脑兀?0 判斷順序棧是否為空；11 釋放棧。代碼如下：#include #include #include #define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define NULL 0#define OVERFLOW -2type

2、def int Status;typedef char SElemType;Status visit(SElemType e;#define STACK_INIT_SIZE 100 / 棧存儲空間的初始分配量#define STACKINCREMENT 10 / 存儲空間分配增量typedef struct SElemType *base; / 存儲數(shù)據(jù)元素的數(shù)組SElemType *top; / 棧頂指針int stacksize; / 當(dāng)前分配的?？臻g大小,以sizeof(SElemType為單位SqStack;Status InitStack (SqStack &S / 構(gòu)造一個

3、空棧SS.base = (SElemType *malloc(STACK_INIT_SIZE * sizeof(SElemType;if (!S.base exit (OVERFLOW;S.top = S.base;S.stacksize = STACK_INIT_SIZE;return OK;/ InitStackStatus DestroyStack (SqStack &S / 銷毀棧Sfree(S.base;S.base=NULL;S.top=NULL;S.stacksize=0;return OK;/ DestroyStackStatus StackEmpty (SqStack

4、 S / 判斷棧S是否為空if(S.top=S.basereturn TRUE;elsereturn FALSE;/ StackEmptyStatus Push (SqStack &S, SElemType e / 插入元素e為新的棧頂元素if (S.top - S.base >= S.stacksize / 棧滿，追加存儲空間S.base = (SElemType * realloc(S.base,(S.stacksize + STACKINCREMENT * sizeof (SElemType;if (!S.base exit (OVERFLOW; /存儲分配失敗S.top

5、= S.base + S.stacksize;S.stacksize += STACKINCREMENT;*S.top+ = e;return OK;/ Pushint StackLength (SqStack S / 返回S的元素個數(shù)，即棧的長度return S.top-S.base;/ StackLengthStatus visit(SElemType e printf("%3d",e;return OK;/ visitStatus GetTop (SqStack S, SElemType &e / 若棧不空，則用e返回S的棧頂元素if(S.top=S.base

6、 return ERROR;e = *(S.top-1;return OK;/ GetTopStatus Pop (SqStack &S, SElemType &e / 若棧不空，則刪除S的棧頂元素if(S.top=S.base return ERROR;e= * -S.top;return OK;/ PopStatus StackTraverse (SqStack S, Status( *visit(SElemType / 遍歷棧while(S.top!=S.basevisit(*-S.top;return OK;/ StackTraversevoid main( / 主函數(shù)

7、SElemType e;SqStack S;printf("(1初始化順序棧。n"InitStack(S;printf("(2判斷順序棧是否為空:n"StackEmpty(S;printf("(3依次進(jìn)棧元素a,b,c,d,e:n"Push(S,'a'Push(S,'b'Push(S,'c'Push(S,'d'Push(S,'e'printf("(4判斷順序棧是否為空:n"StackEmpty(S;printf("(5輸出棧長度:%dn",StackLength(S;printf("(6輸出從棧頂?shù)綏５椎脑?n"StackTraverse(S,visit;printf("(7讀出棧頂元素:%dn",GetTop(S,e;printf("(8刪除棧頂元素:%dn",Pop(S,e;printf("(9輸出從棧頂?shù)綏?/p>