四 栈的链式存储

简单链式栈

////////////链表结点结构体/////////////
typedef struct Node
{
    int data;
    Node* next;
}Node;

//创建结点
Node* createNode(int data)
{
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->data = data;
    newNode->next = NULL;
    return newNode;
}

/////////栈结构体////////////////
typedef struct Stack
{
    Node* stackTop;    //用栈顶指针表示整个链表
    int size;
}stack;

//创建栈
stack* createStack()
{
    stack* mystack = (stack*)malloc(sizeof(stack));
    mystack->stackTop = NULL;
    mystack->size = 0;
    return mystack;
}
//入栈
void push(stack* mystack, int data)
{
    //入栈--->链表的表头插入
    Node* newNode = createNode(data);
    newNode->next = mystack->stackTop;
    mystack->stackTop = newNode;    //栈顶指针移动
    mystack->size++;
}
//获取栈顶元素
int top(stack* mystack)
{
    if (mystack->size == 0)
    {
        printf("栈为空,无法获取");
        system("pause");
        return mystack->size;
    }
    return mystack->stackTop->data;
}
//出栈
void pop(stack* mystack)
{
    if (mystack->size == 0)
    {
        printf("栈为空,无法获取");
        system("pause");
    }
    else
    {
        //缓存
        Node* nextNode = mystack->stackTop->next;
        //删除
        free(mystack->stackTop);
        mystack->stackTop = nextNode;//栈顶指针移动
        mystack->size--;
    }
}
//判断栈是否为空
int empty(stack* mystack)
{
    if (mystack->size == 0)
        return 0;
    return 1;    //返回1 表示栈不为NULL

}
int main()
{
    stack* mystack = createStack();
    push(mystack, 1);
    push(mystack, 2);
    push(mystack, 3);
    while (empty(mystack))
    {
        printf("%d-->", top(mystack));
        pop(mystack);
    }

    system("pause");
    return 0;
}

企业链式栈

linkStack.h

#pragma once
#include <stdio.h>
#include <stdlib.h>

//链表小结点
typedef struct StackNode
{
    struct StackNode* next;
}StackNode;

//链栈结构体
typedef struct LinkStack
{
    StackNode header;
    int size;
}LinkStack;

//初始化
LinkStack* Init_Stack();

//压栈
void Push_Stack(LinkStack* LStack, StackNode* data);

//弹栈
void* Pop_Stack(LinkStack* LStack);

//获取栈顶
void* Top_Stack(LinkStack* LStack);

//是否为空栈
int IsEmpty_Stack(LinkStack* LStack);

//返回栈的大小
int Size_Stack(LinkStack* LStack);

//销毁栈
void Desory_Stack(LinkStack* LStack);

linkStack.c

#include "linkStack.h"

//初始化
LinkStack* Init_Stack()
{
    LinkStack* LS = (LinkStack*)malloc(sizeof(LinkStack));
    LS->header.next = NULL;
    LS->size = 0;
    return LS;
}

//压栈
void Push_Stack(LinkStack* LStack, StackNode* data)
{
    if (LStack == NULL || data == NULL)
    {
        return;
    }
    data->next = LStack->header.next;
    LStack->header.next=data;
    LStack->size++;
}

//弹栈
void* Pop_Stack(LinkStack* LStack)
{
    if (LStack == NULL||LStack->size==0)
        return NULL;
    StackNode* node = LStack->header.next;
    LStack->header.next = node->next;
    LStack->size--;
    return node;

}

//获取栈顶
void* Top_Stack(LinkStack* LStack)
{
    if (LStack == NULL || LStack->size == 0)
        return NULL;
    StackNode* node = LStack->header.next;
    return node;
}

//返回栈的大小
int Size_Stack(LinkStack* LStack)
{
    if (LStack == NULL)
        return -1;
    return LStack->size;
}


//是否为空栈  0 非空 1 空
int IsEmpty_Stack(LinkStack* LStack)
{
    if (LStack == NULL || LStack->size == 0)
        return 1;
    return 0;
}

//销毁栈
void Desory_Stack(LinkStack* LStack)
{
    if (LStack == NULL)
        return;
    free(LStack);
    LStack = NULL;
}

main.c

#include "linkStack.h"

//数据
typedef struct Person
{
    StackNode node;
    char name[64];
    int age;
}Person;

int main()
{
    Person p1 = { "NULL","张飞",21 };
    Person p2 = { "NULL","李逵",19 };
    Person p3 = { "NULL","何进",23 };
    Person p4 = { "NULL","武松",24 };
    Person p5 = { "NULL","袁晓",20 };
    //创建栈
    LinkStack* stack = Init_Stack();
    //插入数据
    Push_Stack(stack, &p1);
    Push_Stack(stack, &p2);
    Push_Stack(stack, &p3);
    Push_Stack(stack, &p4);
    Push_Stack(stack, &p5);
    printf("栈顶元素:name=%s age=%d\n", ((Person*)Top_Stack(stack))->name, ((Person*)Top_Stack(stack))->age);
    while (!IsEmpty_Stack(stack))
    {
        Person* p = Pop_Stack(stack);
        printf("name=%s age=%d\n", p->name, p->age);
    }

    Desory_Stack(stack);
    system("pause");
    return 0;
}