数据结构之栈的相关操作

//栈的顺序存储相关操作
#include<stdio.h>
#include<stdlib.h>
//#include<string.h>
#define MAX 100
//定义结构体
typedef struct Stack
{
    int *data;
    int *top;
    int stacksize;
}Stack;
//初始化空栈
int stackinit(Stack *s)
{
    s->data=(int*)malloc(sizeof(int)*MAX);
    if(s->data==NULL)
    {
        printf("初始化失败！");
    }
    s->top=s->data;
    s->stacksize=MAX;
    return 0;
}

//判断是否为空
int stackisempty(Stack *s)
{
    if(s->data==s->top)
    {
        return 1;
    }
    else
    {
        return 0;
    }
}
//进栈
int stackpush(Stack *s,int a)
{
    if(s->top-s->data>=s->stacksize)
    {
        s->data=(int*)realloc(s->data,sizeof(int)*(MAX+s->stacksize));
        if(s->data==NULL)
        {
            printf("重新分配空间失败！");
            return 0;
        }
        s->stacksize=s->stacksize+MAX;
        s->top=s->data+MAX;
    }
    *s->top=a;
    s->top++;
    return 1;
}
//出栈
int stackpop(Stack *s,int *a)
{
    if(stackisempty(s)==1)
    {
        printf("出栈失败！");
        return 0;
    }
    else
    {
        s->top--;
        *a=*s->top;
        return 1;
    }
}

//返回栈的长度
int stacklength(Stack *s)
{
    return (s->top-s->data);
}
//遍历栈
int stacktraverse(Stack *s)
{
    int *s1=NULL;
//    s1=(int *)malloc(sizeof(int));
    s1=s->top;
    if(stackisempty(s)==1)
    {
        printf("栈为空！");
        return 0;
    }
    while(--s1!=s->data)
    {
        printf("%d  ",*s1);
    }
    printf("\n");
    return 1;
}
//清空栈
int stackdestory(Stack *s)
{
    s->top=s->data;
    return 1;
}
void main()
{
    int i=0;
    int a=0;
    Stack s;
    stackinit(&s);
    for(i=0;i<10;i++)
    {
        stackpush(&s,i);
    }
    printf("length of s :%d\n",stacklength(&s));
    stacktraverse(&s);
    stackpop(&s,&a);
    printf("pop:%d\n",a);
    stacktraverse(&s);
    printf("length of s :%d\n",stacklength(&s));
    printf("s is empty?:%d\n",stackisempty(&s));
    stackdestory(&s);
    printf("s is empty?:%d\n",stackisempty(&s));
}