Push和Pop操作原理

#include<iostream>
#include<cstdio>
using namespace std;
#define MAXSIZE 100
typedef struct//堆栈的定义
{
    int data[MAXSIZE];
    int top;
}SqStack;

int Push (SqStack *s,int e) //Push
{
    if(s->top==MAXSIZE-1)//判断是否满栈
        return 0;
    s->top++;