数据结构栈（Last In First Out）实现

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

typedef int STDataType;

typedef struct Stack
{
	int* a;//顺序表的起始地址
	int top;//栈顶
	int capacity;//容量
}ST;
//栈的初始化
void STInit(ST* ps);
//栈的销毁
void Destroy(ST* ps);

//栈的后进 Last In
void STPush(ST* ps, STDataType x);
//栈的前出 First Out
void STPop(ST* ps);

//判断栈的大小
int STSize(ST* ps);
//判断栈是否为空
bool STEmpty(ST* ps);

//返回栈顶元素
STDataType STTop(ST* ps);

#define _CRT_SECURE_NO_WARNINGS 1
#include"Stack.h"

void STInit(ST* ps)
{
	assert(ps);

	ps->a = (STDataType*)malloc(sizeof(STDataType) * 4);
	if (ps->a == NULL)
	{
		perror("malloc fail");
		return ;
	}
	ps->capacity = 4;
	ps->top = 0;//top 是栈顶元素的下一个位置

	//ps->top = -1;//top就是栈顶元素的位置
}
void Destroy(ST* ps)
{
	assert(ps);

	free(ps->a);
	ps->a = NULL;
	ps->top = 0;
	ps->capacity = 0;
}

void STPush(ST* ps, STDataType x)
{
	assert(ps);

	if (ps->top == ps->capacity)
	{
		STDataType* tmp = (STDataType *) realloc(ps->a, sizeof(STDataType) * ps->capacity * 2);
		if (tmp == NULL)
		{
			perror("realloc fail");
			return;
		}

		ps->a = tmp;
		ps->capacity *= 2;
	}

	ps->a[ps->top] = x;
	ps->top++;  //top指针后移一位
}

void STPop(ST* ps)
{
	assert(ps);
	assert(!STEmpty(ps));

	ps->top--;
}

int STSize(ST* ps)
{
	assert(ps);

	return ps->top;
}
bool STEmpty(ST* ps)
{
	assert(ps);

	return ps->top == 0;
}

STDataType STTop(ST* ps)
{
	assert(ps);
	assert(!STEmpty(ps));

	return ps->a[ps->top - 1];
}

#define _CRT_SECURE_NO_WARNINGS 1

#include "Stack.h"

int main()
{
	ST st;
	STInit(&st);
	STPush(&st, 1);
	STPush(&st, 2);
	STPush(&st, 3);
	STPush(&st, 4);
	STPush(&st, 5);

	while (!STEmpty(&st))
	{
		printf("%d ", STTop(&st));
		STPop(&st);
	}
	return 0;
}