数据结构实验报告栈进制转换.doc

数据结构试验报告栈的应用进制转换程序姓名班级学号算法步骤：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-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 ERROR;*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( &s , &e );N = N / a ;while(s.base!=s.top) Pop(&s ,&e); printf(%d,e);free(s.base);system(pause);3.源程序#include #include#include#define STACK_INIT_SIZE 100#define STACKINCREMENT 10#define OK 1#define ERROR 0#define OVERFLOW -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 - 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-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.体会这次数据结构作业我选择了做进制转换，首先我觉得这个比较有实际意义，其次我觉得做迷宫比较难。这次主要是学习如何用栈，栈自动分配变量，以及函数调用时所使用的一些空间。通过编写这次程序，提高了对栈的理解，自我