栈的构建(顺序表形式)

Test.c

#define _CRT_SECURE_NO_WARNINGS 1

//栈的特点：数据先进后出（同时在栈中的数据）

#include "Stack.h"
void TestStack()
{
	ST st;
	StackInit(&st);
	StackPush(&st, 1);
	StackPush(&st, 2);
	StackPush(&st, 3);
	StackPush(&st, 4);
	StackPush(&st, 5);
	while (!StackEmpty(&st))
	{
		printf("%d ",StackTop(&st));
		StackPop(&st);
	}
	printf("\n");

	StackDestory(&st);
}


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

Stack.h

#define _CRT_SECURE_NO_WARNINGS 1

#pragma once
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <stdbool.h>

typedef int STDataType;
typedef struct Stack
{
	STDataType* a;
	int top; // 相当于size(顺序表元素的个数)
	int capacity;
}ST;

void StackInit(ST* ps); //初始化
void StackDestory(ST* ps); //销毁栈开辟的空间
void StackPush(ST* ps ,STDataType x); //压栈
void StackPop(ST* ps);    //出栈
STDataType StackTop(ST* ps); //取栈顶的元素
bool StackEmpty(ST* ps); //判断栈是否为空
int StackSize(ST* ps); //计算栈中的元素个数

Stack.c

#define _CRT_SECURE_NO_WARNINGS 1
#include "Stack.h"

void StackInit(ST* ps) //初始化
{
	assert(ps);
	ps->a = NULL;
	ps->top = 0;
	ps->capacity = 0;
}

void StackDestory(ST* ps) //销毁栈开辟的空间
{
	assert(ps);
	free(ps->a);
	ps->a = NULL;
	ps->top = ps->capacity = 0;
}


void StackPush(ST* ps, STDataType x)  //压栈
{
	assert(ps);
	if (ps->top == ps->capacity)
	{
		int newcapacity = (ps->capacity == 0) ? 4 : ps->capacity * 2;
		STDataType* tmp = (STDataType*)realloc(ps->a,sizeof(STDataType)*newcapacity);
		if (NULL==tmp)
		{
			printf("realloc fail\n");
			exit(-1);
		}
		ps->a = tmp;
		ps->capacity = newcapacity;
	}

	ps->a[ps->top] = x;
	ps->top++;
}

void StackPop(ST* ps)  //出栈
{
	assert(ps);
	assert(!StackEmpty(ps));
	ps->top--;
}

STDataType StackTop(ST* ps) //取栈顶的元素
{
	assert(ps);
	assert(!StackEmpty(ps));

	return (ps->a[ps->top-1]); //栈顶的元素为: 第pop个元素的前一个元素
}

bool StackEmpty(ST* ps) //判断栈是否为空
{
	assert(ps);
	return (ps->top == 0);
}

int StackSize(ST* ps) //计算栈中的元素个数
{
	assert(ps);
	return ps->top; //top就是顺序表中的size
}