數(shù)據(jù)結(jié)構(gòu)實(shí)驗(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 struct(int *base;int *top;int stacksize;Stack;int In itStack(Stack *s)(s-base=(i nt *)malloc(STACK_INIT_SIZE * sizeof(i nt);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

2、-base = STACK_INIT_SIZE)(s-base=(int *)realloc(s-base , (s-stacksize + STACKINCREMENT) sizeof(int);if(!s-base)wexit(OVERFLOW);s-top=s-base + STACKINCREMENT;d* s-top + = *e;return OK;)3 .出棧程序int Pop(Stack *s , int *e) ( if(s-top = s-base) (return ERROR;*e = * - s-top;return OK;)4.主函數(shù)與進(jìn)制轉(zhuǎn)化void mai n()

3、(int N;int a;int e;Stack s;lnitStack(&s);Pop(&s, &e);Push(&s ,&e);lnitStack(&s);printf(清輸入十進(jìn)制數(shù)：); scanf(”%d”,&N);printf( 要將Ni?；癁閮哼M(jìn)制？);scanf(d”,&a);while(N)(e=N%a;Push( &s, &e);N = N/a;while(s.base!=s.top)(Pop(&s ,&e);printf(%d,e);free(s.base);system(HpauseH);)3 源程序#in elude #in clude#in clude #defi

4、ne STACK INIT SIZE 100#defi ne STACKINCREMENT 10#defi ne OK 1#defi ne ERROR 0#defi ne OVERFLOW#defi ne TRUE 1#defi ne FALSE -1typedef struct(int *base;int *top;int stacksize;Stack;nt In itStack(Stack *s)(s-base=(int *)malloc(STACKJNIT_SIZE * sizeof(int); if(!s-base)exit(OVERFLOW);s-top=s-base;s-stac

5、ksize=STACK_INIT_SIZE;return OK;)int Push(Stack *s , int *e)(if(s-top s-base = STACK_INIT_SIZE)s-base=(int *)realloc(s-base , (s-stacksize + STACKINCREMENT) *sizeof(int);|if(!s-base)exit(OVERFLOW);s-top=s-base + STACKINCREMENT;I1 s-top + = *e;return OK;)int Pop(Stack *s , int *e)(if(s-top = s-base)

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