顺序栈及链栈的出入栈操作

顺序栈：

#include<iostream>
using namespace std;
const int Maxn=100;
typedef struct SNode{
    int data[Maxn];
    int top=-1;
}Stack;

int Push(Stack *s,int n){//将n个数入栈 
    if(s->top==Maxn-1) {
        cout<<"ERROR!";
        return 0;
    }
    int v;
    while(n!=0){
        s->top++;
        cin>>v;
        s->data[s->top]=v;
        --n; 
    }
    return 1;
}
int Pop(Stack *s){//出栈操作 
    if(s->top==-1){
        cout<<"ERROR!";
        return 0;
    }
    s->top--;
    return 1;
}
void Print(Stack s){
    if(s.top==-1) cout<<"ERROR！"<<endl;
    while(s.top>=0){
        cout<<s.data[s.top]<<" ";
        --s.top;
    }
    cout<<endl; 
}
int main(){
    Stack s;
    int n; cin>>n;
    Push(&s,n);
    Print(s);
    Pop(&s);
    Print(s);
    return 0;
}

链栈：

#include<stdlib.h>
#include<iostream>
using namespace std;

typedef struct SNode{//链栈节点结构 
    int data;
    struct SNode *next;
}*SPtr;
typedef struct LStack{//链栈结构 
    SPtr top;
    int count=0;
}Stack;

int Push(Stack *S,int n){//入栈 
    SPtr s;
    int v;
    while(n!=0){
        s=(SNode*)malloc(sizeof(SNode));
        cin>>v;
        s->data=v;
        s->next=S->top;
        S->top=s;
        S->count++;
        --n;
    }
    return 0;
}
int Pop(Stack *S){//出栈 
    SPtr s;
    s=S->top;
    S->top=S->top->next;
    S->count--;
    free(s);
    return 0;
}

void Print(Stack S){
    if(S.top==NULL) cout<<"ERROR!"<<endl;
    else{
        SPtr s=S.top;
        while(s!=NULL){
            cout<<s->data<<" ";
            s=s->next;
        }
        cout<<endl;
    }
}
int main(){
    Stack S;
    int n; cin>>n;
    Push(&S,n);
    //Print(S);
    Pop(&S);
    Print(S);
    
    return 0;
}