栈的顺序存储

栈的顺序存储

SeqStack.h

#pragma once

#include<stdlib.h>
#include<string.h>

#ifdef __cplusplus
extern "C"{
#endif


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


#ifdef __cplusplus
}
#endif

SeqStack.c

#include"SeqStack.h"

//初始化
SeqStack Init_SeqStack()
{
	struct SStack *stack = malloc(sizeof(struct SStack));
	if (NULL == stack)
	{
		return NULL;
	}

	//memset(stack->data, 0, sizeof(struct SStack));
	stack->size = 0;
	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 *s = (struct SStack *)stack;

	if (s->size == MAX)
	{
		return;
	}

	s->data[s->size] = data;
	s->size++;
}
//出栈
void Pop_SeqStack(SeqStack stack)
{

	if (NULL == stack)
	{
		return;
	}

	struct SStack *s = (struct SStack *)stack;

	if (s->size == 0)
	{
		return;
	}


	s->data[s->size - 1] = NULL;
	s->size--;
}
//获得栈顶元素
void *Top_SeqStack(SeqStack stack)
{
	if (NULL == stack)
	{
		return NULL;
	}

	struct SStack *s = (struct SStack *)stack;

	if (s->size == 0)
	{
		return NULL;
	}


	return s->data[s->size - 1];

}
//获得栈的大小
int Size_SeqStack(SeqStack stack)
{
	if (NULL == stack)
	{
		return -1;
	}

	struct SStack *s = (struct SStack *)stack;

	return s->size;
}
//销毁栈
void Destroy_SeqStack(SeqStack stack)
{

	if (NULL == stack)
	{
		return;
	}

	free(stack);
}

03 栈的顺序存储.c

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include"SeqStack.h"

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