数据结构——顺序栈

这里给出一份数据结构上机实验课的顺序栈代码以及说明。

#include<stdio.h>
#include<malloc.h>
#define ERROR 0
#define OK 1
#define STACK_INT_SIZE 10  /*存储空间初始分配量*/
#define STACKINCREMENT 5  /*存储空间分配增量*/
typedef  int ElemType; /*定义元素的类型*/
typedef struct
{
    ElemType *base;///栈的起始地址
    ElemType *top;///栈顶指针
    int stacksize;     /*当前已分配的存储空间*/
} SqStack;
int InitStack(SqStack *S);   /*构造空栈*/
int push(SqStack *S,ElemType e); /*入栈*/
int Pop(SqStack *S,ElemType *e);  /*出栈*/
int GetTop(SqStack *S,ElemType *e);///取栈顶元素
int CreateStack(SqStack *S);     /*创建栈*/
void PrintStack(SqStack *S);   /*出栈并输出栈中元素*/
int InitStack(SqStack *S)
{
    S->base=(ElemType *)malloc(STACK_INT_SIZE *sizeof(ElemType));
    if(!S->base)///存储分配失败
    {
        return ERROR;
    }
    S->top=S->base;
    S->stacksize=STACK_INT_SIZE;
    return OK;
}/*InitStack*/
int Push(SqStack *S,ElemType e)
{

    if((S->top)-(S->base)==S->stacksize)///栈已满，追加空间
    {
        S->base=(ElemType *)realloc(S->base,(S->stacksize+STACKINCREMENT)*sizeof(ElemType));
        if(S->base==NULL)///追加空间失败
        {
            return 0;
        }
        S->top=S->base+S->stacksize;///新空间的栈顶指针
        S->stacksize=S->stacksize+STACKINCREMENT;///新空间的容量
    }
    *S->top=e;///在栈顶插入元素e
    S->top++;///修改栈顶指针
    return 1;
}/*Push*/

int Pop(SqStack *S,ElemType *e)
{
    if(S->top==S->base)///栈为空
    {
        return 0;
    }
    else
    {
        S->top--;///出栈，修改栈顶指针
        *e=*S->top;
        return 1;
    }
}/*Pop*/
int GetTop(SqStack *S,ElemType *e)
{
    if(S->top==S->base)///栈为空
    {
        return 0;
    }
    else
    {
        *e=*(S->top-1);///取栈顶元素和出栈的区别是栈顶指针并没有改变
        return 1;
    }
    return 1;
}
int CreateStack(SqStack *S)
{
    int e;
    if(InitStack(S))
    {
        printf("Init Success!
");
    }
    else
    {
        printf("Init Fail!
");
        return ERROR;
    }
    printf("input data:(Terminated by inputing a character)
");
    while(scanf("%d",&e))
    {
        Push(S,e);
    }
    return OK;
}/*CreateStack*/
void PrintStack(SqStack *S)
{
    ElemType e;
    while(Pop(S,&e))
    {
        printf("%3d",e);
    }

}/*Pop_and_Print*/

int main()
{
    SqStack ss;
    printf("
1-createStack
");
    CreateStack(&ss);
    printf("
2-Pop&Print
");
    PrintStack(&ss);
    return 0;
}

在第1题的程序中，编写一个十进制转换为二进制的数制转换算法函数（要求利用栈来实现），并验证其正确性。

#include<stdio.h>
#include<malloc.h>
#define ERROR 0
#define OK 1
#define STACK_INT_SIZE 10  /*存储空间初始分配量*/
#define STACKINCREMENT 5  /*存储空间分配增量*/
typedef  int ElemType; /*定义元素的类型*/
typedef struct
{
    ElemType *base;
    ElemType *top;
    int stacksize;     /*当前已分配的存储空间*/
} SqStack;
int InitStack(SqStack *S);   /*构造空栈*/
int push(SqStack *S,ElemType e); /*入栈*/
int Pop(SqStack *S,ElemType *e);  /*出栈*/
int CreateStack(SqStack *S);     /*创建栈*/
void PrintStack(SqStack *S);   /*出栈并输出栈中元素*/
int InitStack(SqStack *S)
{
    S->base=(ElemType *)malloc(STACK_INT_SIZE *sizeof(ElemType));
    if(!S->base) return ERROR;
    S->top=S->base;
    S->stacksize=STACK_INT_SIZE;
    return OK;
}/*InitStack*/
int Push(SqStack *S,ElemType e)
{
    if((S->top)-(S->base)==S->stacksize)
    {
        S->base=(ElemType *)realloc(S->base,(S->stacksize+STACKINCREMENT)*sizeof(ElemType));
        if(S->base==NULL)
        {
            return 0;
        }
        S->top=S->base+S->stacksize;
        S->stacksize=S->stacksize+STACKINCREMENT;
    }
    *S->top=e;
    S->top++;
    return 1;
}/*Push*/
int Pop(SqStack *S,ElemType *e)
{
    if(S->top==S->base)
    {
        return 0;
    }
    else
    {
        S->top--;
        *e=*S->top;
        return 1;
    }
}/*Pop*/
int IsEmpty(SqStack *S)
{
    if(S->top==S->base)
        return 1;
    else
        return 0;
}
void Change(int n)
{
    SqStack S;
    int x;
    InitStack(&S);
    while(n>0)
    {
        x=n%2;
        Push(&S,x);
        n=n/2;
    }
    while(!IsEmpty(&S))
    {
        Pop(&S,&x);
        printf("%d", x);
    }
}
int main()
{
    SqStack ss;
    int n;
    printf("请输入一个十进制数
");
    scanf("%d",&n);
    printf("转换后变成的二进制数
");
    Change(n);
    return 0;
}