堆栈的链式存储实现

 

 链式栈头文件：

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

//链式栈的结点
typedef struct LINKNODE
{
    LINKNODE* next;
}LinkNode;

//链式栈
typedef struct LINKSTACK
{
    LinkNode head;
    int size;
}LinkStack;

//初始化链表
LinkStack* Init_LinkStack();
//入栈
void Push_LinkStack(LinkStack* lstack, LinkNode* value);
//出栈
void Pop_LinkStack(LinkStack* lstack);
//返回栈顶元素
LinkNode* Top_LinkStack(LinkStack* lstack);
//返回栈元素个数
int Size_LinkStack(LinkStack* lstack);
//清空栈
void Clear_LinkStack(LinkStack* lstack);
//销毁栈
void Free_LinkStack(LinkStack* lstack);

 链式栈实现文件：

#include "栈的链式存储.h"
//初始化链表
LinkStack* Init_LinkStack()
{
    LinkStack* lstack = (LinkStack*)malloc(sizeof(LinkStack));
    if (lstack == NULL)
    {
        exit(1);
    }

    lstack->head.next = NULL;
    lstack->size = 0;

    return lstack;
}
//从头节点入栈
void Push_LinkStack(LinkStack* lstack, LinkNode* value)
{
    if (lstack == NULL)
    {
        exit(1);
    }

    if (value == NULL)
    {
        exit(1);
    }

    value->next = lstack->head.next;
    lstack->head.next = value;
    lstack->size++;
}
//出栈
void Pop_LinkStack(LinkStack* lstack)
{
    if (lstack == NULL)
    {
        exit(1);
    }

    if (lstack->size == 0)
    {
        exit(1);
    }

    //
    LinkNode* pCurrent = lstack->head.next;
    lstack->head.next = pCurrent->next;
    lstack->size--;
}
//返回栈顶元素
LinkNode* Top_LinkStack(LinkStack* lstack)
{
    if (lstack == NULL)
    {
        exit(1);
    }

    if (lstack->size == 0)
    {
        exit(1);
    }

    return lstack->head.next;
}
//返回栈元素个数
int Size_LinkStack(LinkStack* lstack)
{
    if (lstack == NULL)
    {
        exit(1);
    }

    return lstack->size;
}
//清空栈
void Clear_LinkStack(LinkStack* lstack)
{
    if (lstack == NULL)
    {
        exit(1);
    }

    lstack->head.next = NULL;
    lstack->size = 0;
}
//销毁栈
void Free_LinkStack(LinkStack* lstack)
{
    if (lstack == NULL)
    {
        exit(1);
    }

    free(lstack);
}

链式栈测试：

#include"栈的链式存储.h"
#include<string.h>
#include<stdlib.h>
#include<stdio.h>

#define M 8
#define N 3
//数据元素结构体
typedef struct PERSON
{
    LinkNode node;
    char name[64];
    int age;
}Person;

int main(int argc, const char* argv[])
{
    //创建循环链表
    LinkStack* lstack = Init_LinkStack();

    //创建数据
    Person p1, p2, p3, p4, p5;
    strcpy_s(p1.name, "aaa");
    strcpy_s(p2.name, "bbb");
    strcpy_s(p3.name, "ccc");
    strcpy_s(p4.name, "ddd");
    strcpy_s(p5.name, "eee");
    
    p1.age = 20;
    p2.age = 30;
    p3.age = 40;
    p4.age = 50;
    p5.age = 60;

    //入栈
    Push_LinkStack(lstack, (LinkNode*)&p1);
    Push_LinkStack(lstack, (LinkNode*)&p2);
    Push_LinkStack(lstack, (LinkNode*)&p3);
    Push_LinkStack(lstack, (LinkNode*)&p4);
    Push_LinkStack(lstack, (LinkNode*)&p5);

    //出栈
    Person* tmp = (Person*)Top_LinkStack(lstack);
    printf("name %s age %d
", tmp->name, tmp->age);

    //删除
    Pop_LinkStack(lstack);

    //出栈
    tmp = (Person*)Top_LinkStack(lstack);
    printf("name %s age %d
", tmp->name, tmp->age);

    //判断是否为空
    int ret = Size_LinkStack(lstack);
    printf("判断是否为空:%d
", ret);
    //清空栈
    Clear_LinkStack(lstack);
    
    //释放
    Free_LinkStack(lstack);
    system("pause");
    return 0;
}