实现顺序栈基本运算 --栈

C语言实现顺序栈的入栈、出栈、栈元素读取操作

#include <stdio.h>
#include <stdlib.h>
#define MaxSize 20
#define MaxNum  10 
#define ElemType int
typedef struct SqStack
{        //存储结构定义
    ElemType elem[MaxSize];            //栈元素的存储空间
    int top;                        //栈顶指针
}SqStack;        //存储结构类型名

void Init_SqStack(SqStack *s)
{
    s->top = -1;
}

void Push(SqStack *s,ElemType x)
{
    if (s->top < MaxSize - 1)
    {
        s->top = s->top + 1;
        s->elem[s->top] = x;
    }
    else
        printf("栈已满，不能入栈!
");
}

int Pop(SqStack *s)
{
    ElemType x;
    if (s->top != -1)
    {
        x = s->elem[s->top];
        s->top = s->top-1;
        return x;
    }
    else
    {
        printf("栈为空，不能出栈!
");
        return 0;
    }
}

int Get_Top(SqStack *s,ElemType x)
{
    if (s->top != -1)
    {
        x = s->elem[s->top];
    }
    else
    {
        printf("栈为空!
");
        return 0;
    }
}

int Get_Base(SqStack *s,ElemType x)
{
    if (s->top != -1)
    {
        x = s->elem[0];
    }
    else
    {
        printf("栈为空!
");
        return 0;
    }
}

void Display00_SqStack(SqStack *s)
{
    int n;
    if (s->top == -1)
        printf("顺序栈为空");
    else
    {
        for (n = 0; n <= s->top; n ++)
            printf("%d ",s->elem[n]);
        printf("
");
    }
}

void Display01_SqStack(SqStack *s)
{
    int m;
    if (s->top == -1)
        printf("顺序栈为空!
");
    else
    {
        for (m = s->top; m >= 0; m--)
            printf("%d ",s->elem[m]);
        printf("
");
    }
}

int main()
{
    SqStack s;
    int x,y,cord,p;
    ElemType a;
    Init_SqStack(&s);
    for (int t = 1; t <= MaxNum; t++)
    {
        Push(&s,t);
    }
    printf("初始化
依次进栈元素为：
");
    Display00_SqStack(&s);
    printf("从栈顶到栈底元素为: 
");
    Display01_SqStack(&s);
    do{
        printf("
                 主菜单                 
");
        printf("        1    入栈                     
");
        printf("        2    出栈                     
");
        printf("        3    读栈顶元素                 
");
        printf("        4    读栈底元素                 
");
        printf("        5    结束程序                 
");
        printf("-----------------------------------------------------
");
        printf("请输入你选择的菜单号<1,2,3,4>: ");
        scanf("%d",&cord);
        switch(cord)
        {
            case 1:
                printf("请输入入栈元素:");
                scanf("%d",&a);
                Push(&s,a);
                printf("由栈顶到栈底的元素为: 
");
                Display01_SqStack(&s);
                break;
            case 2:
                x = Pop(&s);
                printf("出栈元素为: %d
",x);
                printf("由栈顶到栈底的元素为: 
");
                Display01_SqStack(&s);
                break;
            case 3:
                y = Get_Top(&s,x);
                printf("栈顶元素为: %d
",y);
                printf("由栈顶到栈底的元素为: 
");
                Display01_SqStack(&s);
                break;
            case 4:
                p = Get_Base(&s,x);
                printf("栈底元素为: %d
",p);
                printf("由栈顶到栈底的元素为: 
");
                Display01_SqStack(&s);
                break;
            case 5:
                exit(0);
                break;
            default:
                printf("输入有误!");
        }
    }
    while(cord <= 4);
}

运行结果：