數(shù)據(jù)結(jié)構(gòu)試驗(yàn)報(bào)告棧進(jìn)制轉(zhuǎn)換

1、數(shù)據(jù)結(jié)構(gòu)試驗(yàn)報(bào)告棧的應(yīng)用一一進(jìn)制轉(zhuǎn)換程序姓名班級(jí)學(xué)號(hào)算法步驟：1定義棧與建立空棧typedef structint *base;int *top;int stacksize;Stack;int In itStack(Stack *s)s-base=(int *)malloc(STACK_INIT_SIZE * sizeof(int); if(!s-base)exit(OVERFLOW); s-top=s-base; s-stacksize=STACK_INIT_SIZE; return OK;2入棧程序int Push(Stack *s , int *e)if(s-top - s-base =

2、 STACK_INIT_SIZE)s-base=(i nt *)realloc(s-base , (s-stacksize + STACKINCREMENT) sizeof( in t);if(!s-base) Iexit(OVERFLOW); s-top=s-base + STACKINCREMENT;* s-top + = *e;return OK;3出棧程序int Pop(Stack *s , int *e)4主函數(shù)與進(jìn)制轉(zhuǎn)化void mai n()int N;int a;int e;Stack s;In itStack(&s);Pop(&s , &e);Push(&s，&e);In i

3、tStack(&s);printf(請(qǐng)輸入十進(jìn)制數(shù)：);scan f(%d,&N);while(s.base!=s.top) Pop(&s，& e); prin tf(%d,e); free(s.base); system(pause);3源程序#in clude #in clude#in clude#define STACK INIT SIZE 100#defi ne STACKINCREMENT 10#defi ne OK 1#defi ne ERROR 0#defi ne OVERFLOW -1#defi ne TRUE 1#defi ne FALSE -1typedef structi

4、nt e = * - s-top;base;int *top;int stacksize;Stack;nt In itStack(Stack *s)s-base=(int *)malloc(STACK_INIT_SIZE * sizeof(int);if(!s-base)exit(OVERFLOW);s-top=s-base;s-stacksize=STACK INIT SIZE;return OK;int Push(Stack *s , int *e)if(s-top - s-base = STACK_INIT_SIZE)s-base=(i nt *)realloc(s-base , (s-

5、stacksize + STACKINCREMENT) sizeof( in t);if(!s-base)exit(OVERFLOW);s-top=s-base + STACKINCREMENT;* s-top + = *e;return OK;nt Pop(Stack *s , int *e)if(s-top = s-base)return ERROR;lreturn OK; void mai n()In itStack(&s); Pop(&s , &e); Push(&s，&e); In itStack(&s);printf(請(qǐng)輸入十進(jìn)制數(shù)：);scan f(%d,&N);printf(要將N轉(zhuǎn)化為幾進(jìn)制？);scan f(%d,&a);Pop(&s，& e);prin tf(%d,e);free(s.base);system(pause);調(diào)試與體會(huì)1. 調(diào)試結(jié)果2. 體會(huì)這次數(shù)據(jù)結(jié)構(gòu)作業(yè)我選擇了做進(jìn)制轉(zhuǎn)換，首先我覺(jué)得這個(gè)比較有實(shí)際意義，其次我覺(jué)得做迷宮比較難。這次主要是學(xué)習(xí)如何用棧，棧自動(dòng)分配變量， 以及函數(shù)調(diào)用時(shí)所使用的一些空間。通過(guò)編寫(xiě)這次程序，提高了對(duì)棧的理解，自我查找與學(xué)習(xí)交流能力，這