栈的链式存储
LinkStack.h
#pragma once
#include<stdlib.h>
#include"LinkList.h"
struct StackNode
{
struct StackNode *next;
};
struct LStack
{
struct StackNode header; //头结点
int size;
};
typedef void* LinkStack;
#ifdef __cplusplus
extern "C"{
#endif
//初始化
LinkStack Init_LinkStack();
//入栈
void Push_LinkStack(LinkStack stack, void *data);
//出栈
void Pop_LinkStack(LinkStack stack);
//获得栈顶元素
void* Top_LinkStack(LinkStack stack);
//获得大小
int Size_LinkStack(LinkStack stack);
//销毁栈
void Destroy_LinkStack(LinkStack stack);
#ifdef __cplusplus
}
#endif
LinkStack.c
#include"LinkStack.h"
//初始化
LinkStack Init_LinkStack()
{
struct LStack *stack = malloc(sizeof(struct LStack));
if (NULL == stack)
{
return NULL;
}
stack->header.next = NULL;
stack->size = 0;
return stack;
}
//入栈
void Push_LinkStack(LinkStack stack, void *data)
{
if (NULL == stack)
{
return;
}
if (NULL == data)
{
return;
}
struct LStack *ls = (struct LStack *)stack;
struct StackNode *node = (struct StackNode *)data;
node->next = ls->header.next;
ls->header.next = node;
++(ls->size);
}
//出栈
void Pop_LinkStack(LinkStack stack)
{
if (NULL == stack)
{
return;
}
struct LStack *ls = (struct LStack *)stack;
if (ls->size == 0)
{
return;
}
//缓存下第一个节点
struct StackNode *pFirst = ls->header.next;
ls->header.next = pFirst->next;
ls->size--;
}
//获得栈顶元素
void* Top_LinkStack(LinkStack stack)
{
if (NULL == stack)
{
return NULL;
}
struct LStack *ls = (struct LStack *)stack;
if (ls->size == 0)
{
return NULL;
}
return ls->header.next;
}
//获得大小
int Size_LinkStack(LinkStack stack)
{
if (NULL == stack)
{
return -1;
}
struct LStack *ls = (struct LStack *)stack;
return ls->size;
}
//销毁栈
void Destroy_LinkStack(LinkStack stack)
{
if (NULL == stack)
{
return;
}
free(stack);
stack = NULL;
}
04 栈的链式存储.c
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include"LinkStack.h"
struct Person
{
struct StackNode node;
char name[64];
int age;
};
void test()
{
//初始化栈
LinkStack stack = Init_LinkStack();
//创建数据
struct Person p1 = { NULL, "aaa", 10 };
struct Person p2 = { NULL, "bbb", 20 };
struct Person p3 = { NULL, "ccc", 30 };
struct Person p4 = { NULL, "ddd", 40 };
struct Person p5 = { NULL, "eee", 50 };
struct Person p6 = { NULL, "fff", 60 };
//数据入栈
Push_LinkStack(stack, &p1);
Push_LinkStack(stack, &p2);
Push_LinkStack(stack, &p3);
Push_LinkStack(stack, &p4);
Push_LinkStack(stack, &p5);
Push_LinkStack(stack, &p6);
//输出栈中所有元素
while (Size_LinkStack(stack) > 0)
{
//获得栈顶元素
struct Person *person = (struct Person *)Top_LinkStack(stack);
//打印
printf("Name:%s Age:%d\n", person->name, person->age);
//弹出栈顶元素
Pop_LinkStack(stack);
}
printf("Size:%d\n", Size_LinkStack(stack));
}
int main(){
test();
system("pause");
return EXIT_SUCCESS;
}