线性栈及链栈

#include <iostream>

using namespace std;

#define MAXSIZE 100

typedef struct SqStack {
    int *base;
    int *top;
    int stackSize;
} SqStack;

//链栈
typedef struct StackNode {
    int data;
    struct StackNode *next;
} StackNode, *LinkStack;

typedef enum {
    OK = 1,
    ERROR = 0
} States;

States InitStack(SqStack &S) {
    S.base = new int[MAXSIZE];
    if (!S.base)
        return ERROR;
    S.top = S.base;
    S.stackSize = MAXSIZE;
    return OK;
}

States Push(SqStack &S, int elem) {
    if (S.top - S.base == S.stackSize) return ERROR;
    *S.top++ = elem;
    return OK;
}

States Pop(SqStack &S, int &elem) {
    if (S.top == S.base) return ERROR;
    elem = *--S.top;
    return OK;
}

int GetTop(SqStack S) {
    if (S.top != S.base)
        return *(S.top - 1);
    return 0;
}

/**********************************************************************************/

States InitStackLink(LinkStack &S) {
    S = nullptr;
    return OK;
}

States PushLink(LinkStack &S, int elem) {
    LinkStack p = new StackNode;
    p->data = elem;
    p->next = S;
    S = p;
    return OK;
}

States PopLink(LinkStack &S, int &elem) {
    if (S == nullptr) return ERROR;
    elem = S->data;
    LinkStack p = S;
    S = S->next;
    delete p;
    return OK;
}

int GetTopLink(LinkStack &S) {
    if (S == nullptr) return ERROR;
    return S->data;
}


int main() {
    LinkStack stackNode;
    InitStackLink(stackNode);

    PushLink(stackNode, 11);
    PushLink(stackNode, 12);
    PushLink(stackNode, 13);
    PushLink(stackNode, 14);

    int s1 = GetTopLink(stackNode);
    return 0;
}

本文作者: zhangJinLong
本文链接: https://zhang426fly.github.io/2025/08/26/data_structure/stack/
版权声明: 本博客所有文章除特别声明外，均采用BY-NC-SA许可协议。转载请注明出处！