第6周 项目4—数制转换

1.头文件：sqstack.h，包含定义顺序栈数据结构的代码、宏定义、要实现算法的函数的声明；

#define MaxSize 100typedef int ElemType;typedef struct{    ElemType data[MaxSize];    int top;                //栈指针} SqStack;                  //顺序栈类型定义void InitStack(SqStack *&s);    //初始化栈void DestroyStack(SqStack *&s);  //销毁栈bool StackEmpty(SqStack *s);     //栈是否为空int StackLength(SqStack *s);  //返回栈中元素个数——栈长度bool Push(SqStack *&s,ElemType e); //入栈bool Pop(SqStack *&s,ElemType &e); //出栈bool GetTop(SqStack *s,ElemType &e); //取栈顶数据元素void DispStack(SqStack *s);  //输出栈

2.源文件：sqstack.cpp，包含实现各种算法的函数的定义

#include <stdio.h>#include <malloc.h>#include "sqstack.h"void InitStack(SqStack *&s){    s=(SqStack *)malloc(sizeof(SqStack));    s->top=-1;}void DestroyStack(SqStack *&s){    free(s);}int StackLength(SqStack *s)  //返回栈中元素个数——栈长度{    return(s->top+1);}bool StackEmpty(SqStack *s){    return(s->top==-1);}bool Push(SqStack *&s,ElemType e){    if (s->top==MaxSize-1)    //栈满的情况，即栈上溢出        return false;    s->top++;    s->data[s->top]=e;    return true;}bool Pop(SqStack *&s,ElemType &e){    if (s->top==-1)     //栈为空的情况，即栈下溢出        return false;    e=s->data[s->top];    s->top--;    return true;}bool GetTop(SqStack *s,ElemType &e){    if (s->top==-1)         //栈为空的情况，即栈下溢出        return false;    e=s->data[s->top];    return true;}void DispStack(SqStack *s)  //输出栈{    int i;    for (i=s->top;i>=0;i--)        printf("%c ",s->data[i]);    printf("\n");}

3.主函数

#include <stdio.h>#include "sqstack.h"void MultiBaseOutput (int number,int base){    //假设number是非负的十进制整数，输出等值的base进制数    int i;    SqStack *S;    InitStack(S);    while(number)   //从右向左产生base进制的各位数字，并将其进栈    {        Push(S,number%base); //将将余数进栈        number/=base;    }    while(!StackEmpty(S))   //栈非空时退栈输出    {        Pop(S, i);        printf("%d",i);    }}int main(){    MultiBaseOutput(10, 2);    return 0;}