C语言链表栈的实现

用企业链表实现链式栈

LinkStack.h

#pragma once

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); // 入栈
LinkNode* Top_LinkStack(LinkStack* stack);             // 返回栈顶元素
void Pop_LinkStack(LinkStack* stack);                  // 出栈
int Size_LinkStack(LinkStack* stack);                  // 返回栈的尺寸
void Clear_LinkStack(LinkStack* stack);                // 清空栈
void FreeSpace_LinkStack(LinkStack* stack);            // 销毁栈

这里用的是链表的头插法

#include "LinkStack.h"
#include<stdio.h>
#include<stdlib.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++;

}

LinkNode* Top_LinkStack(LinkStack* stack)
{
	if (stack == NULL)
		return NULL;

	return stack->head.next;
}

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--;


}

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);
}

链式栈测试函数

#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <stdlib.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 = 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);

	}
	system("pause");
	FreeSpace_LinkStack(stack);
}