栈的简单实现

一些函数和结构体 

#pragma once
#include<iostream>
#include<cassert>
#include<malloc.h>
using namespace std;
typedef int STDateType;
typedef struct Stack
{
	STDateType* a;
	int top;
	int capacity;
}ST;
void StackInit(ST* ps);
void StackDestroy(ST* ps);
void StackPush(ST* ps, STDateType x);
void StackPop(ST* ps);
STDateType StackTop(ST* ps);
int StackSize(ST* ps);
bool StackEmpty(ST* ps);

功能实现

void StackInit(ST* ps)//初始化
{
	assert(ps);
	ps->a = NULL;
	ps->top = 0;
	ps->capacity = 0;
}
void StackDestroy(ST* ps)//销毁
{
	assert(ps);
	free(ps->a);
	ps->a = NULL;
	ps->capacity = 0;
	ps->top = 0;
}
void StackPush(ST* ps, STDateType x)//入栈
{
	assert(ps);
	if (ps->top == ps->capacity)
	{
		int newcapacity = ps->capacity == 0 ? 4 : ps->capacity * 2;
		STDateType* temp = (STDateType*)realloc(ps->a, sizeof(STDateType) * newcapacity);
		if (temp == NULL)
		{
			cout << "realloc fail\n";
			exit(-1);
		}
		else
		{
			ps->a = temp;
			ps->capacity = newcapacity;
		}
	}
	ps->a[ps->top] = x;
	ps->top++;
}
void StackPop(ST* ps)//出栈
{
	assert(ps);
	assert(ps->top > 0);
	//assert(!StackEmpty);
	ps->top--;
}
STDateType StackTop(ST* ps)//取栈顶数据
{
	assert(ps);
	assert(ps->top > 0);
	//assert(!StackEmpty);
	return ps->a[ps->top - 1];
}
int StackSize(ST* ps)//返回存储数据个数
{
	assert(ps);
	return ps->top;
}
bool StackEmpty(ST* ps)//判断是否为空
{
	assert(ps);
	return ps->top == 0;
}