顺序栈 总结

#include <bits/stdc++.h>
using namespace std;

#define MaxSize 10

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

//初始化栈
void InitStack(SqStack &S)
{
    S.top = -1;//初始化栈顶指针
}

//判断栈空
bool StackEmpty(SqStack S)
{
    if(S.top == -1) //空
        return true;
    else //不空
        return false;
}

//新元素入栈
bool Push(SqStack & S ,ElemlType x)
{
    if(S.top == MaxSize - 1) //栈满，报错
        return false;
    S.top = S.top + 1; //指针先加1
    S.data[S.top] = x; //新元素入栈
    return true;
}

//出栈操作
bool Pop(SqStack &S ,ElemType &x)
{
    if(S.top == -1) //栈空
        return false;
    x = S.data[S.top];
    S.top = S.top -1;
    return true;
}

void testStack()
{
    SqStack S;//声明 一个顺序栈
    //...后续操作...
}

signed main()
{

}