与顺序栈不同,链栈主要通过对于链表的首个元素节点来操作(头插头删)来实现栈的特性。
LinkStack.h
#pragma once
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
//链式栈结点
typedef struct LINKNODE
{
struct LINKNODE* next;
}LinkNode;
//链式栈
typedef struct LINKSTACK
{
LinkNode head;
int size;
}LinkStack;
//初始化函数
LinkStack* Init_LinkStack();
//入栈
void Push_LinkStack(LinkStack* stack, LinkNode* data);
//出栈
void Pop_LinkStack(LinkStack* stack);
//返回栈顶元素
LinkNode* Top_LinkStack(LinkStack* stack);
//返回栈元素的个数
int Size_LinkStack(LinkStack* stack);
//清空栈
void Clear_LinkStack(LinkStack* stack);
//销毁栈
void FreeSpace_LinkStack(LinkStack* stack);
LinkStack.c
#include"LinkStack.h"
//初始化函数
LinkStack* Init_LinkStack()
{
LinkStack* stack = (LinkStack*)malloc(sizeof(LinkStack));
stack->size = 0;
stack->head.next = NULL;
return stack;
}
//入栈
void Push_LinkStack(LinkStack* stack, LinkNode* data)
{
if (stack == NULL || data == NULL)
{
return;
}
data->next = stack->head.next;
stack->head.next = data;
stack->size++;//大小的增加不要忘
}
//出栈
void Pop_LinkStack(LinkStack* stack)
{
if (stack == NULL)
{
return;
}
if (stack->size == 0)//重点:没有元素的时候不需要操作了,无法出栈
{
return;
}
//第一个有效结点
LinkNode* pDel = stack->head.next;
stack->head.next = pDel->next;
stack->size--;
}
//返回栈顶元素
LinkNode* Top_LinkStack(LinkStack* stack)
{
if (stack == NULL|| stack->size==0)
{
return NULL;
}
return stack->head.next;
}
//返回栈元素的个数
int Size_LinkStack(LinkStack* stack)
{
if (stack == NULL)
{
return -1;
}
return stack->size;
}
//清空栈
void Clear_LinkStack(LinkStack* stack)
{
if (stack == NULL)
{
return;
}
stack->size = 0;
stack->head.next = NULL;
}
//销毁栈
void FreeSpace_LinkStack(LinkStack* stack)
{
if (stack == NULL)
{
return;
}
free(stack);
}
栈的链式存储结构.c
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include"LinkStack.h"
typedef struct PERSON
{
LinkNode node;
char name[64];
int age;
}Person;
int main()
{
//创建链栈
LinkStack* stack = Init_LinkStack();
//创建数据
Person p1, p2, p3, p4, p5;
strcpy(p1.name, "aaa");
strcpy(p2.name, "bbb");
strcpy(p3.name, "ccc");
strcpy(p4.name, "ddd");
strcpy(p5.name, "eee");
p1.age = 50;
p2.age = 40;
p3.age = 30;
p4.age = 20;
p5.age = 10;
//入栈
Push_LinkStack(stack, (LinkNode*)&p1);
Push_LinkStack(stack, (LinkNode*)&p2);
Push_LinkStack(stack, (LinkNode*)&p3);
Push_LinkStack(stack, (LinkNode*)&p4);
Push_LinkStack(stack, (LinkNode*)&p5);
//输出
while (stack->size > 0)
{
Person* p = (Person*)Top_LinkStack(stack);
printf("Name: %s, Age: %d\n", p->name, p->age);
Pop_LinkStack(stack);
}
FreeSpace_LinkStack(stack);
system("pause");
return 0;
}
测试结果: