栈的顺序存储结构和链式存储结构的实现

偷个懒，整合一下书上代码就得到了

顺序存储：

#include<iostream>
#include<cstdlib>
#define MaxSize 30

using namespace std;

struct SqStack {
    int data[MaxSize];
    int top;
}; 

void InitStack(SqStack *& s) {
    s = (SqStack *)malloc(sizeof(SqStack));
    s->top = -1;
}

void DestroyStack(SqStack *& s) {
    free(s);
}

bool StackEmpty(SqStack * s) {
    return (s->top == -1);
}

bool Push(SqStack *& s,int e) {
    if(s->top == MaxSize - 1)
        return false;
    s->top++;
    s->data[s->top] = e;
    return true;
}

bool Pop(SqStack *& s,int & e) {
    if(s->top == -1)
        return false;
    e = s->data[s->top];
    s->top--;
    return true;
}

bool GetTop(SqStack *& s,int & e) {
    if(s->top == -1)
        return false;
    e = s->data[s->top];
    return true;
}

int main()
{
    SqStack * s;
    int e = 9;
    InitStack(s);
    cout<<StackEmpty(s)<<endl;
    cout<<Push(s,5)<<endl;
    cout<<GetTop(s,e)<<endl;
    cout<<Pop(s,e)<<" "<<e<<endl;
    DestroyStack(s);
    return 0;
} 

链式存储：

#include<iostream>
#include<cstdlib>
#define MaxSize 30

using namespace std;

struct LiStack {
    int data;
    struct LiStack * next;
}; 

void InitStack(LiStack *& s) {
    s = (LiStack *)malloc(sizeof(LiStack));
    s->next = NULL;
}

void DestroyStack(LiStack *& s) {
    LiStack * p = s,* q = s->next;
    while(q != NULL) {
        free(p);
        p = q;
        q = p->next;
    } 
    free(p);
}

bool StackEmpty(LiStack * s) {
    return (s->next == NULL);
}

void Push(LiStack *& s,int e) {
    LiStack * p;
    p = (LiStack *)malloc(sizeof(LiStack));
    p->data = e;
    p->next = s->next;
    s->next = p;
}

bool Pop(LiStack *& s,int & e) {
    LiStack * p; 
    if(s->next == NULL)
        return false;
    p = s->next;
    e = p->data;
    s->next = p->next;
    free(p); 
    return true;
}

bool GetTop(LiStack *& s,int & e) {
    if(s->next == NULL)
        return false;
    e = s->next->data;
    return true;
}

int main()
{
    LiStack * s;
    int e = 9;
    InitStack(s);
    cout<<StackEmpty(s)<<endl;
    Push(s,5);
    cout<<GetTop(s,e)<<endl;
    cout<<Pop(s,e)<<" "<<e<<endl;
    DestroyStack(s);
    return 0;
} 

2020-05-25