数据结构----------顺序栈基本操作实现

#include<stdio.h>

#define MaxSize 10

typedef int ElemType;
typedef struct{
    ElemType data[MaxSize];
    int top; //栈顶
}SqStack;

/*                        初始化操作                                     */
void init(SqStack *stack)
{
    stack->top = -1;  //初始化栈顶置为-1
}


/*                        判空操作                                     */
int isEmpty(SqStack stack)
{
    return stack.top==-1; //栈空返回1
}

/*                        输出操作                                     */
void dispStack(SqStack stack)
{
    if (isEmpty(stack))
        printf("栈空");
    else{
    for (int i=0;i<=stack.top;i++)
        printf("stack[%d]=%d\n",i,stack.data[i]);
    }
}



/*                        进栈操作                                     */
int push(SqStack *stack,int x)
{
    if (stack->top == MaxSize-1)    //栈满
        return -1;
    stack->top = stack->top+1; //指针上移
    stack->data[stack->top] = x; //入栈
    return 1;
}


/*                        出栈操作                                     */
int pop(SqStack *stack,int *e)
{
    if (stack->top == -1)
        return -1;//栈空
    *e = stack->data[stack->top]; //出栈
    stack->top = stack->top - 1; //指针下移
    return 1;
}

/*                        取栈顶元素                                     */
int pick(SqStack stack,int *e)
{
    if (isEmpty(stack))
        return -1;
    *e = stack.data[stack.top];
    return 1;
}

int destroy(SqStack *stack)
{
    stack->top = -1;
    return 1;
}

int main()
{
    SqStack stack;
    init(&stack);
    int flag = 1;
    // printf("1.入栈操作\n");
    // printf("2.出栈操作\n");
    // printf("3.输出操作\n");
    // printf("4.判空操作\n");
    // printf("5.销毁操作\n");
    while (flag!=-1)
    {   printf("\n");
        printf("--------------------------------工具栏------------------------------------\n");
        printf("1.入栈操作\n");
        printf("2.出栈操作\n");
        printf("3.取顶操作\n");
        printf("4.判空操作\n");
        printf("5.输出操作\n");
        printf("6.销毁操作\n");
        printf("7.退出\n");
        printf("\n");
        int a = 0;
        int e = 0;
        int x = 0;
        printf("请选择你的操作:");
        scanf("%d",&a);
        switch (a)
        {
        case 1: printf("请输入你入栈的元素:");
                int num = 0;
                scanf("%d",&num);
                if (push(&stack,num))
                    printf("入栈成功！\n");
                else
                    printf("入栈失败，栈满!\n");
                break;
        case 2: if (pop(&stack,&e))
                    printf("出栈成功，栈顶元素为%d\n",e);
                break;
        case 3: if(pick(stack,&x))
                    printf("栈顶元素为：%d\n",x);
                else
                    printf("栈空!\n");
                break;
        case 4: if (isEmpty(stack))
                    printf("栈空\n");
                else
                    printf("栈非空！\n");
                break;
        case 5: dispStack(stack);break;
        case 6: if(destroy(&stack))
                    printf("销毁成功！\n");
                else
                    printf("销毁失败！\n");
                break;
        case 7: flag = -1;break;
        default: flag = -1;
            break;
        }
    }
    
}

运行结果图