【数据结构】栈的创建

Stack.h

#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
#include<assert.h>

//创建栈的结构体
typedef int STDateType;
typedef struct Stack
{
	STDateType* a;
	int top;
	int capacity;
}ST;

//栈的初始化
void STInit(ST* pst);

//栈的销毁
void STDesTroy(ST* pst);

//栈的添加
void STPush(ST* pst, STDateType x);

//栈的删除
void STPop(ST* pst);

//判断栈是否为空
bool STEmpty(ST* pst);

//获取栈中元素的个数
int STSize(ST* pst);

//获取栈顶元素
STDateType STTop(ST* pst);

Stack.c

#include"Stack.h"

//栈的初始化
void STInit(ST* pst)
{
	assert(pst);
	pst->a = NULL;
	pst->top = 0;
	pst->capacity = 0;
}

//栈的销毁
void STDesTroy(ST* pst)
{
	assert(pst);
	free(pst->a);
	pst->top = pst->capacity = 0;
	pst = NULL;
}

//栈的添加
void STPush(ST* pst, STDateType x)
{
	assert(pst);
	//判断是否要开辟空间
	if (pst->top == pst->capacity)
	{
		int newcapacity = pst->capacity == 0 ? 4 : pst->capacity * 2;
		STDateType* tmp = (STDateType*)realloc(pst->a, sizeof(STDateType) * newcapacity);
		if (tmp == NULL)
		{
			perror("realloc fail:");
			exit(1);
		}
		pst->capacity = newcapacity;
		pst->a = tmp;
	}
	pst->a[pst->top] = x;
	pst->top++;
}

//栈的删除
void STPop(ST* pst)
{
	assert(pst);
	assert(pst->top > 0);
	pst->top--;
}

//判断栈是否为空
bool STEmpty(ST* pst)
{
	assert(pst);
	if (pst->top != 0)
		return true;
	return false;
}

//获取栈中元素的个数
int STSize(ST* pst)
{
	assert(pst);
	return pst->top;
}

//获取栈顶元素
STDateType STTop(ST* pst)
{
	assert(pst);
	assert(pst->top > 0);
	return pst->a[pst->top - 1];
}

test.c

#include"Stack.h"

void STTest()
{
	ST pst;
	//栈的初始化
	STInit(&pst);
	//入栈
	STPush(&pst, 1);
	STPush(&pst, 2);
	STPush(&pst, 3);
	STPush(&pst, 4);
	STPush(&pst, 5);
	printf("%d ", STTop(&pst));
	STPop(&pst);
	printf("%d ", STTop(&pst));
	STPop(&pst); 
	//判断是否为空
	bool d = STEmpty(&pst);
	if (d)
	{
		printf("\n不为空\n");
	}
	else
	{
		printf("\n为空\n");
	}
	//查询栈中还有几个元素
	int x = STSize(&pst);
	printf("有%d个元素", x);

	//栈的销毁
	STDesTroy(&pst);
}

int main()
{
	STTest();
	return 0;
}