图解三种栈

图解数据结构

第一章 单链表
第二章 双链表
第三章 栈

---

---

链栈&&顺序栈&&共享栈

---

提示：以下是本篇文章正文内容，下面案例可供参考

一、链栈

1.结构体

typedef struct StackNode{
    int data;
    struct StackNode *next;
}StackNode, *LStack ;
typedef struct StackTop{
    LStack top;
    int count;
}StackTop, *ST;

2.入栈

void Push(ST st, int value){  
    LStack lStack = (LStack)malloc(sizeof(StackNode));
    lStack->data = value;
    lStack->next = st->top;  // 相当于把st当做头节点；
    st->top = lStack; // 作为下一次的后驱
    st->count++;  // 数量加1；
}

1.出栈

int Pop(ST st){  // 出栈
    if(st->top){
        LStack p;
        int value = st->top->data;
        p = st->top;  // 中间变量间接储存
        st->top = st->top->next;
        free(p);
        st->count--;
        return value;
    } else{
        return -1;
    }
}

二、顺序栈

1.结构体

typedef struct SqStack{
    int data[Max];
    int top;
}SqStack;

2.入栈

void Push(SqStack *sqStack, int vaule){
    if(sqStack->top == Max -1){
        printf("push-error-fill\n");
    } else{
        sqStack->top++;
        sqStack->data[sqStack->top] = vaule;
    }
}

3.出栈

int Pop(SqStack *sqStack){
    if(sqStack->top == -1){
        printf("pop-error-The stack is null\n");
    } else{
        return sqStack->data[(sqStack->top)--];
    }
    return -1;
}

三、共享栈

1.结构体

#define MAX 40
typedef struct ShareStack{
    int data[MAX];
    int top;
    int top2;
} *SStack, stack;

2.入栈

void Push(SStack sStack, int SelectStack, int value){  // 入栈
    if(sStack->top == sStack->top2){
        printf("push-error-fill\n");
    } else{
        if(SelectStack == 1){
            sStack->top++;
            sStack->data[sStack->top] = value;
        }
        if (SelectStack == 2){
            sStack->top2--;
            sStack->data[sStack->top2] = value;
        }
        if (SelectStack != 1 && SelectStack != 2){
            printf("not found stack\n");
        }
    }
}

2.出栈

int Pop(SStack sStack, int SelectStack){  // 出栈
    if (SelectStack == 1){
        if (sStack->top == -1){
            printf("pop-error-The stack is null\n");
        } else{
            return sStack->data[(sStack->top)--];
        }
    } else if (SelectStack == 2){
        if (sStack->top2 == MAX){
            printf("pop-error-The stack is null\n");
        } else{
            return sStack->data[(sStack->top2)++];
        }
    }
    return -1;
}

---

总结

也是线性表的一种，只不过进出方式有所不同