顺序栈

冷不防 2022-07-16 13:29 158阅读 0赞

2016年7月23日12:43:45
        顺序栈的基本运算
    #include <stdio.h>
    #define STICKSIZE 100
    
    //定义栈的结构体类型
    typedef  struct 
    {
        int stick[STICKSIZE];
        int top;
    }SeqStick;
    
    //函数声明
    void initStick( SeqStick * s);
    int  isEmpty(SeqStick * s);
    int  isFull(SeqStick * s);
    int  pushStick(SeqStick * s,int element);
    int  popStick(SeqStick * s,int * e);
    int  getTop(SeqStick * s);
    void traverseStick(SeqStick * s);
    int  getLength(SeqStick * s);
    void destroyStick(SeqStick * s);
    
    //顺序栈的初始化
    void initStick( SeqStick * s)
    {
        s->top = -1;
        return ;
    }
    
    //判断顺序栈是否为空
    int isEmpty(SeqStick * s)
    {
        if(-1 == s->top)
            return 1;
        else
            return 0;
    }
    
    //判断栈是否为满
    int isFull(SeqStick * s)
    {
        if(STICKSIZE == s->top)
            return 1;
        else
            return 0;
    }
    
    //获取栈中有效元素的个数
    int getLength(SeqStick * s)
    {
        return s->top+1;
    }
    
    //将元素e入栈
    int pushStick(SeqStick * s,int element)
    {
        if(isFull(s))
            return 0;
        else
        {
            s->top++;
            s->stick[s->top] = element;
            return 1;
        }
    }
    
    //对顺序栈的栈顶元素进行出栈操作
    int  popStick(SeqStick * s, int * val)
    {
        if(isEmpty(s))
            return 0;
        else
        {
            *val = s->stick[s->top];
            s->top--;
            return 1;
        }
    }
    
    //获取栈顶元素
    int getTop(SeqStick * s,int * element)
    {
        if(isEmpty(s))
            return 0;
        else
        {
            *element = s->stick[s->top];
            return 1;
        }
    }
    
    //销毁顺序栈
    void destroyStick(SeqStick * s)
    {
        s->top = -1;
    }
    
    //将顺序栈中元素进行遍历输出
    void traverseStick(SeqStick * s)
    {
        int i;
        for ( i = 0;i<=s->top;i++)
        {
            printf("%d ",s->stick[s->top]);
        }
        printf("\n");
        return;
    }
    
    //主函数
    int main(void)
    {
        SeqStick s;
        int val;
        initStick(&s);
        if(pushStick(&s,1))
        {
            printf("入栈成功!\n");
        }
        else
        {
            printf("栈已满,无法继续入栈!\n");
        }
        traverseStick(&s);
        if(popStick(&s,&val))
        {
            printf("出栈成功!\n");
        }
        else
        {
            printf("出栈失败!\n");
        }
        traverseStick(&s);
        return 0;
    }