c语言数据结构 栈的顺序存储

seqStack.h

#ifndef  _SEQSTACK_H_
#define  _SEQSTACK_H_

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

#define MAX 1024

struct SStack
{
	void *data[MAX];

	//栈的元素个数
	int m_Size;
};
typedef void *seqStack;

//测试数据
struct Person
{
	char name[64];
	int age;
};


//初始化栈
extern seqStack init_SeqStack();

//入栈
extern void push_SeqStack(seqStack stack, void *data);

//出栈
extern void pop_SeqStack(seqStack stack);

//获取栈顶元素
extern void *top_SeqStack(seqStack stack);

//栈的大小
extern int size_SeqStack(seqStack stack);

//判断栈是否为空
extern int isEmpty_SeqStack(seqStack stack);

//销毁栈
extern void destory_SeqStack(seqStack stack);


#endif // ! _SEQSTACK_H_

seqStack.c

#include "seqStack.h"


//初始化栈
seqStack init_SeqStack()
{
	struct SStack *stack = malloc(sizeof(struct SStack));
	if (stack == NULL)
	{
		perror("malloc");
		return NULL;
	}
	//清空数组中每个元素
	memset(stack->data, 0, sizeof(seqStack)*MAX);
	stack->m_Size = 0;

	return stack;
}
//入栈
void push_SeqStack(seqStack stack, void *data)
{
	if (stack == NULL || data == NULL)
		return;

	//判断是否已经栈满
	struct SStack *myStack = stack;
	if (myStack->m_Size == MAX)
		return;

	myStack->data[myStack->m_Size] = data;//入栈尾插
	myStack->m_Size++;//更新栈大小
	return;
}

//出栈
void pop_SeqStack(seqStack stack)
{
	if (stack == NULL)
	{
		return;
	}

	//如果是空栈 不执行出栈
	struct SStack *myStack = stack;
	if (myStack->m_Size <= 0)
	{
		return;
	}

	//执行出栈
	myStack->data[myStack->m_Size - 1] = NULL;
	//更新栈的大小
	myStack->m_Size--;

	return;

}

//获取栈顶元素
void *top_SeqStack(seqStack stack)
{
	if (stack == NULL)
	{
		return NULL;
	}

	struct SStack *myStack = stack;

	//如果是空栈 返回NULL
	if (myStack->m_Size == 0)
	{
		return NULL;
	}

	return myStack->data[myStack->m_Size - 1];
}

//栈的大小
int size_SeqStack(seqStack stack)
{
	if (stack == NULL)
	{
		return -1;
	}
	struct SStack *myStack = stack;

	return myStack->m_Size;
}
//判断栈是否为空
int isEmpty_SeqStack(seqStack stack)
{
	if (stack == NULL)
	{
		return -1;//真
	}
	struct SStack *myStack = stack;
	if (myStack->m_Size <= 0)
	{
		return 1;//真
	}
	return 0;//返回假 代表不是空栈
}

//销毁栈
void destory_SeqStack(seqStack stack)
{
	if (stack == NULL)
	{
		return;
	}

	free(stack);
	stack = NULL;

	return;
}

main.c

#include "seqStack.h"


void test01()
{
	//准备数据
	struct Person p1 = { "aaa", 18 };
	struct Person p2 = { "bbb", 19 };
	struct Person p3 = { "ccc", 20 };
	struct Person p4 = { "ddd", 21 };
	struct Person p5 = { "eee", 22 };
    
	//初始化栈
	seqStack stack = init_SeqStack();

	//入栈
	push_SeqStack(stack, &p1);
	push_SeqStack(stack, &p2);
	push_SeqStack(stack, &p3);
	push_SeqStack(stack, &p4);
	push_SeqStack(stack, &p5);

	while (isEmpty_SeqStack(stack) == 0)//栈不为空 进行访问栈顶元素  以及出栈
	{
		struct Person *pTop = top_SeqStack(stack);//栈顶元素
		printf("姓名:%s 年龄:%d\n", pTop->name, pTop->age);

		//出栈
		pop_SeqStack(stack);
	}
	
	//栈的大小
	int size = size_SeqStack(stack);
	printf("栈的大小为:%d\n", size);

	//销毁栈
	destory_SeqStack(stack);
	return;
}
int main(int argc, char* argv[])
{
	test01();
	system("pause");
	return EXIT_SUCCESS;
}

运行结果: