1、數據結構試驗報告棧的應用進制轉換程序姓名班級學號算法步驟：1.定義棧與建立空棧typedef structint *base;int *top;int stacksize;Stack;int InitStack(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

2、->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;* s->top + = *e;return OK;3.出棧程序int Pop(Stack *s , int *e)if(s->top = s->base)return ERRO

3、R;*e = * - s->top;return OK;4.主函數與進制轉化void main()int N;int a;int e; Stack s;InitStack(&s);Pop(&s , &e);Push(&s ,&e);InitStack(&s);printf("請輸入十進制數：");scanf("%d",&N);printf("要將N轉化為幾進制？");scanf("%d",&a);while(N)e=N%a;Push( &

4、s , &e );N = N / a ;while(s.base!=s.top) Pop(&s ,&e); printf("%d",e);free(s.base);system("pause");3.源程序#include <stdio.h>#include<malloc.h>#include<stdlib.h>#define STACK_INIT_SIZE 100#define STACKINCREMENT 10#define OK 1#define ERROR 0#define OVERFL

5、OW -1#define TRUE 1#define FALSE -1typedef structint *base;int *top;int stacksize;Stack;int InitStack(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 -

6、 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;* s->top + = *e;return OK;int Pop(Stack *s , int *e)if(s->top = s->base)return ERROR;*e = * - s->

7、;top;return OK;void main()int N;int a;int e; Stack s;InitStack(&s);Pop(&s , &e);Push(&s ,&e);InitStack(&s);printf("請輸入十進制數：");scanf("%d",&N);printf("要將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("pause");調試與體會1.調試結果2.體會這次數據結構作業我選擇了做進制轉換，首先我覺得這個比較有實際意義，其次我覺得做迷宮比較難。這次主要是學習如何用棧，棧自動分配變量，以及函數調用時所使用的一些空間