实验四：数据结构之顺序栈实践顺序栈实现数制转换

￡神魔★判官ぃ 2023-06-07 12:04 4阅读 0赞

实验结果：

![20191014194841470.png][]

完整源码：

Stack.h

1 #include <stdio.h>
      2 #include <malloc.h>
      3 #define OK 0                        //成功执行
      4 #define Err_Memory -1               //内存分配错误 
      5 #define Err_InvalidParam -2         //输入参数无效
      6 #define Err_Overflow -3             //溢出错误
      7 #define Err_IllegalPos -4           //非法位置
      8 #define Err_NoResult -5             //无法返回结果或返回结果为空
      9 #define Stack_Init_Size 100              //顺序表最大长度
     10 #define Stack_Increment 10         //顺序表存储空间分配增量
     11 
     12 typedef int ElemType;                          //定义顺序表的元素类型ElemType
     13 
     14 typedef struct {
     15     ElemType * stackdata;           //data指向存储数据元素的一维数组，初始大小为Max_Length
     16     int top;                        //顺序表的实际长度,其值小于等于ListLength
     17     int stacksize;                  //当前顺序表分配的空间大小，初始值为Max_Length
     18 } SeqStack;                         //顺序表结构定义
     19 
     20 typedef int Status;                 //定义返回状态
     21 
     22 Status InitStack(SeqStack *S);
     23 Status EmptyStack(SeqStack *S);
     24 Status ClearStack(SeqStack *S);
     25 void TraverseStack(SeqStack *S);
     26 Status LengthStack(SeqStack *S);
     27 Status GetTop(SeqStack *S, ElemType *e);
     28 Status Push(SeqStack *S, ElemType e);
     29 Status Pop(SeqStack *S, ElemType *e);

Stack.c

1 #include "Stack.h"
      2 
      3 
      4 Status InitStack(SeqStack *S)
      5 {
      6     if(!S)
      7         return Err_InvalidParam;
      8 
      9     S->stackdata = (ElemType *)malloc(Stack_Increment*sizeof(ElemType));
     10 
     11     if(!S->stackdata)
     12         return Err_Memory;
     13 
     14     S->top = 0;
     15     S->stacksize = Stack_Init_Size;
     16 
     17     return OK;
     18 }
     19 
     20 Status ClearStack(SeqStack *S)
     21 {
     22     if(!S)
     23         return Err_InvalidParam;
     24 
     25     S->top = 0;
     26 
     27     return 0;
     28 }
     29 
     30 Status EmptyStack(SeqStack *S)
     31 {
     32     if(!S)
     33         return Err_InvalidParam;
     34     return (S->top == 0);
     35 }
     36 
     37 Status LengthStack(SeqStack *S)
     38 {
     39     return S->top;
     40 }
     41 
     42 void TraverseStack(SeqStack *S)
     43 {
     44     int i;
     45 
     46     for(i = 0; i<S->top; i++)
     47       printf("%d\n", *S->stackdata);
     48 }
     49 
     50 Status GetTop(SeqStack *S, ElemType *e)
     51 {
     52     if(!S)
     53         return Err_InvalidParam;
     54 
     55     if(S->top == 0)
     56         return Err_NoResult;
     57 
     58     *e = S->stackdata[S->top-1];
     59 
     60     return 0;
     61 }
     62 
     63 Status Push(SeqStack *S, ElemType e)
     64 {
     65     ElemType *newstack;
     66 
     67     if(!S)
     68         return Err_InvalidParam;
     69 
     70     if(S->top == S->stacksize)
     71         newstack = (ElemType *)realloc(S->stackdata, (S->stacksize+Stack_Increment)*sizeof(ElemType));
     72 
     73     if(!newstack)
     74         return Err_Memory;
     75 
     76 //  S->top = S->stackdata + S->stacksize; //???????????
     77     S->stacksize += Stack_Increment;
     78     S->stackdata[S->top++] = e;
     79 
     80     return OK;
     81 }
     82 
     83 Status Pop(SeqStack *S, ElemType *e)
     84 {
     85 
     86     if(!S)
     87         return Err_InvalidParam;
     88 
     89     if(S->top == 0)
     90         return Err_NoResult;
     91 
     92     *e = S->stackdata[--S->top];
     93 
     94     return OK;
     95 }

进制转换文件：Decimal.c

1 #include <stdio.h>
      2 #include <malloc.h>
      3 #include "Stack.h"
      4 
      5 void conversion(int N, int h)
      6 {
      7     SeqStack *S;
      8     ElemType e;
      9 
     10     S = (SeqStack *)malloc(sizeof(SeqStack));
     11     if(!S){
     12         printf("内存分配错误\n");
     13         return;
     14     }
     15     InitStack(S);
     16     while(N){
     17         Push(S, N%h);
     18         N/=h;
     19     }
     20     printf("转换结果为：\n");
     21     while(!EmptyStack(S)){
     22         Pop(S, &e);
     23         printf("%d", e);
     24     }
     25     printf("\n");
     26 
     27 }
     28 
     29 void main()
     30 {
     31     int N, m;
     32 
     33     printf("请输入要转换的十进制数：\n");
     34     scanf("%d", &N);
     35     printf("请输入要转换的进制：\n");
     36     scanf("%d", &m);
     37     conversion(N, m);
     38 }

编译方式：

linux下：gcc Stack.c Decimal.c

编译完成后，会生成a.out

./a.out执行即可进行数值输入，进制输入，然后输出转换后的值。

[20191014194841470.png]: /images/20230601/232496b448364c51bd92a099ecd34a3d.png