用C语言实现栈的链式存储

栈是一种先进后出的数据结构，且只能进行出栈入栈操作。如下代码是对栈的封装，以链式存储的方式实现了栈的功能。【代码仅供研究使用】

源码分为三个文件，分别为LinkStack.h  LinkStack.c   main.c

LinkStack.h源码：

#ifndef LINKSTACK_H#define LINKSTACK_H#include <stdlib.h>#include <stdio.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);#endif

LinkStack.c源码：

#include"LinkStack.h"//初始化函数LinkStack* Init_LinkStack(){LinkStack* stack = (LinkStack*)malloc(sizeof(LinkStack));stack->head.next = NULL;stack->size = 0;return stack;}//入栈void Push_LinkStack(LinkStack* stack, LinkNode* data){if (stack == NULL){return;}if (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* pNext = stack->head.next;stack->head.next = pNext->next;stack->size--;}//返回栈顶元素LinkNode* Top_LinkStack(LinkStack* stack){if (stack == NULL){return NULL;}if (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->head.next = NULL;stack->size = 0;}//销毁栈void FreeSpace_LinkStack(LinkStack* stack){if (stack == NULL){return;}free(stack);}

main.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(void){//创建栈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 = 10;p2.age = 20;p3.age = 30;p4.age = 40;p5.age = 50;//入栈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 (Size_LinkStack(stack) > 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;}