算法7---栈及其基本操作实现

有关栈的基本概念随便找一本书上面都有详细的介绍，在这里我用c语言只实现。

这一部分包括一些基本的栈的操作，初始化，出栈，入栈，判空，判满，清空等操作。

#include <Stdlib.h>
#include <stdio.h>
#include <string.h>

#define MAXLEN 50

typedef struct
{
    int age;
    char name[10];
}DATA;

typedef struct stack
{
    DATA data[MAXLEN];
    int top;   
}stackType;

stackType *inistack()
{
    stackType *p;
    if (p=(stackType *)malloc(sizeof(stackType )))
    {
        p->top=0;
        return p;
    }
    return NULL;
}

int stackEmpty(stackType *s)
{
    int flag;
    flag=(s->top==0);
    return flag;
}

int stackFull(stackType *s)
{
    int flag;
    flag=(s->top==MAXLEN);
    return flag;
}

void clearStack(stackType *s)
{
    s->top=0;
}

void freeStack(stackType *s)
{
    if (s)
    {
        free(s);
    }
}

int pushStack(stackType *s,DATA data)
{
    if ((s->top+1)>MAXLEN)
    {
        printf("overflow!
");
        return 0;
    }
    s->data[++s->top]=data;
    return 1;
}

DATA popStack(stackType *s)
{
    if (s->top==0)
    {
        printf("empty stack!
");
        exit(0);
    }
    return (s->data[s->top--]);
}


DATA readStack(stackType *s)
{
    if (s->top==0)
    {
        printf("the stack is empty!
");
        exit(0);
    }
    return (s->data[s->top]);
}

int main()
{
    stackType *stack;
    DATA data,data1;
    stack=inistack();
    printf("push stack!
");
    printf("input name,age to push data!
");
    do
    {
        scanf("%s%d",data.name,&data.age);
        if (strcmp(data.name,"0")==0)
        {
            break;
        }
        else
        {
            pushStack(stack,data);
        }
    }while(1);

    do
    {
        printf("pop stack operation!
");
        data1=popStack(stack);
        printf("the pop stack data is (%s,%d)
",data1.name,data1.age);
    }while(1);


    freeStack(stack);
    return 0;

}