栈的学习笔记

只要满足先进后出这种存取方式的数据结构，都可以称作栈。

1、栈的顺序存储

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAX 1024
//顺序栈数据结构
struct SStack
{
	void *data[MAX]; //存放数据的数组
	int size;//栈中元素的个数
};
typedef void * SeqStack;
//数组高下标的位置当做栈顶，因为不需要移动数组中的元素在插入和删除中
//初始化
SeqStack Init_SeqStack();
//入栈
void Push_SeqStack(SeqStack stack, void *data);
//出栈
void Pop_SeqStack(SeqStack stack);
//获得栈顶元素
void *Top_SeqStack(SeqStack stack);
//获得栈的大小
int Size_SeqStack(SeqStack stack);
//销毁栈
void Destroy_SeqStack(SeqStack stack);
SeqStack Init_SeqStack()
{
	struct SStack *stack = (struct SStack*)malloc(sizeof(struct SStack));
	if (NULL == stack)
	{
		return NULL;
	}
	stack->size = 0;
	memset(stack->data, 0, 1024);
	//for (int i = 0; i < MAX; ++i)
	//{
	//	stack->data[i] = NULL;
	//}
	return stack;
}
void Push_SeqStack(SeqStack stack, void *data)
{
	if (NULL == stack)
	{
		return;
	}
	if (NULL == data)
	{
		return;
	}
	struct SStack *sstack = (struct SStack *)stack;//强转
	if (sstack->size == MAX)
	{
		return;
	}
	sstack->data[sstack->size] = data;//压栈
	sstack->size++;//更新栈的大小
}
//出栈
void Pop_SeqStack(SeqStack stack)
{
	if (NULL == stack)
	{
		return;
	}
	struct SStack *sstack = (struct SStack *)stack;//强转
	if (sstack->size == 0)
	{
		return;
	}
	sstack->data[sstack->size - 1] = NULL;
	sstack->size--;//更新栈的大小
}
//获得栈顶元素
void *Top_SeqStack(SeqStack stack)
{
	if (NULL == stack)
	{
		return NULL;
	}
	struct SStack *sstack = (struct SStack *)stack;//强转
	if (sstack->size == 0)
	{
		return NULL;
	}
	struct SStack *topdata;
	topdata = sstack->data[sstack->size-1];//注意获取栈顶元素时，是元素大小减一；
}
//获得栈的大小
int Size_SeqStack(SeqStack stack)
{
	if (NULL == stack)
	{
		return -1;
	}
	struct SStack *sstack = (struct SStack *)stack;//强转
	return sstack->size;
}
//销毁栈
void Destroy_SeqStack(SeqStack stack)
{
	if (NULL == stack)
	{
		return;
	}
	struct SStack *sstack = (struct SStack *)stack;//强转
	free(sstack);
}
struct Person
{
	char name[64];
	int age;
};
void test()
{
	//初始化栈
	SeqStack stack = Init_SeqStack();
	//创建数据
	struct Person p1 = { "aaa", 10 };
	struct Person p2 = { "bbb", 20 };
	struct Person p3 = { "ccc", 30 };
	struct Person p4 = { "ddd", 40 };
	struct Person p5 = { "eee", 50 };
	struct Person p6 = { "fff", 60 };
	//数据入栈
	Push_SeqStack(stack, &p1);
	Push_SeqStack(stack, &p2);
	Push_SeqStack(stack, &p3);
	Push_SeqStack(stack, &p4);
	Push_SeqStack(stack, &p5);
	Push_SeqStack(stack, &p6);

	//输出栈中所有元素
	while (Size_SeqStack(stack) > 0)
	{
		//获得栈顶元素
		struct Person *person = (struct Person *)Top_SeqStack(stack);
		//打印
		printf("Name:%s Age:%d\n", person->name, person->age);
		//弹出栈顶元素
		Pop_SeqStack(stack);
	}
	printf("Size:%d\n", Size_SeqStack(stack));
	//销毁栈
	Destroy_SeqStack(stack);
	stack = NULL;
}

int main() {
	test();
	system("pause");
	return EXIT_SUCCESS;
}

2、栈的链式存储

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
struct linklist {
	struct linklist *next;
};
//链表信息
struct linkinfo {
	struct linklist header;//头指针
	int linksize;//大小
};

//初始化
void * init_link()
{
	struct linkinfo *linkinfor = malloc(sizeof(struct linkinfo));
	if (NULL == linkinfor)
	{
		return NULL;
	}
	linkinfor->linksize = 0;
	linkinfor->header.next = NULL;
	return linkinfor;
}
//压栈
void push_link(void *linkinfo,void *data)
{
	if (NULL == data)
	{
		return;
	}
	if (NULL == linkinfo)
	{
		return;
	}
	struct linkinfo*linkinfor = (struct linkinfo*)linkinfo;
	struct linklist*idata = (struct linklist*)data;
	idata->next = linkinfor->header.next;
	linkinfor->header.next = idata;
	linkinfor->linksize++;
}
//出栈
void pop_link(void *linkinfo)
{
	if (NULL == linkinfo)
	{
		return;
	}
	struct linkinfo*linkinfor = (struct linkinfo*)linkinfo;
	//缓存下第一个节点
	struct linklist*temp = linkinfor->header.next;
	temp = temp->next;
	linkinfor->header.next = temp;
	linkinfor->linksize--;
}
//查询栈顶地址
void *top_link(void*linkinfo)
{
	if (NULL == linkinfo)
	{
		return NULL;
	}
	struct linkinfo*linkinfor = (struct linkinfo*)linkinfo;
	return linkinfor->header.next;
}
//获得栈的大小
int size_link(void*linkinfo)
{
	if (NULL == linkinfo)
	{
		return NULL;
	}
	struct linkinfo*linkinfor = (struct linkinfo*)linkinfo;
	return linkinfor->linksize;
}
void destroy_link(void*linkinfo)
{
	if (NULL == linkinfo)
	{
		return NULL;
	}
	struct linkinfo*linkinfor = (struct linkinfo*)linkinfo;
	free(linkinfor);
	linkinfor = NULL;
}
struct Person
{
	struct linklist node;
	char name[64];
	int age;
};
void test()
{
	struct linkinfo *linkinfor = (struct linkinfo*)init_link();
	//创建数据
	struct Person p1 = { NULL, "aaa", 10 };
	struct Person p3 = { NULL, "bbb", 20 };
	struct Person p2 = { NULL, "ccc", 30 };
	struct Person p4 = { NULL, "ddd", 40 };
	struct Person p5 = { NULL, "eee", 50 };
	struct Person p6 = { NULL, "fff", 60 };
	//数据入栈
	push_link(linkinfor, &p1);
	push_link(linkinfor, &p2);
	push_link(linkinfor, &p3);
	push_link(linkinfor, &p4);
	push_link(linkinfor, &p5);
	push_link(linkinfor, &p6);
	//输出栈中所有元素
	while (size_link(linkinfor) > 0)
	{

		//获得栈顶元素
		struct Person *person = (struct Person *)top_link(linkinfor);
		//打印
		printf("Name:%s Age:%d\n", person->name, person->age);
		//弹出栈顶元素
		pop_link(linkinfor);
	}
	printf("Size:%d\n", size_link(linkinfor));
}
int main() {
	test();
	system("pause");
	return EXIT_SUCCESS;
}