简单实现栈的功能

**

栈的特点

**

先进后出或者是后进先出

**

代码实现

**
.h文件

#pragma once

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


typedef int STDataType;
typedef struct STack
{
    
	STDataType* data;
	int top;
	int capacity;
}ST;


//初始化
void StackInit(ST* ps);

//插入
void StackPush(ST* ps, STDataType x);

//删除
void StackPop(ST* ps);

//取出
STDataType StackTop(ST* ps);

//销毁
void StackDestroy(ST* ps);

//长度
int StackSize(ST* ps);

//判断空
bool StackEmpty(ST* ps);

.c文件

#include"Stack.h"

//初始化
void StackInit(ST* ps)
{
    

	assert(ps);
	ps->top = ps->capacity = 0;
	ps->data = NULL;

}

//插入
void StackPush(ST* ps, STDataType x)
{
    

	assert(ps);

	//判断是否扩容
	if (ps->top == ps->capacity)
	{
    

		int newcapacity = ps->capacity ? (ps->capacity) * 2 : 3;
		STDataType* newdata = (STDataType*)realloc(ps->data, sizeof(STDataType) * newcapacity);
		if (newdata == NULL)
		{
    
			printf("newdata::file");
			exit(-1);
		}

		ps->data = newdata;
		ps->capacity = newcapacity;

	}

	ps->data[ps->top] = x;
	ps->top += 1;

}


//判断空
bool StackEmpty(ST* ps)
{
    
	assert(ps);

	return ps->top == 0;
}


//删除
void StackPop(ST* ps)
{
    
	
	assert(ps);
	assert(!StackEmpty(ps));

	ps->top -= 1;

}

//取出
STDataType StackTop(ST* ps)
{
    
	assert(ps);
	assert(!StackEmpty(ps));

	return ps->data[ps->top - 1];

}

//销毁
void StackDestroy(ST* ps)
{
    

	assert(ps);
	free(ps->data);
	ps->data = NULL;
	ps->capacity=ps->top = 0;

}

//长度
int StackSize(ST* ps)
{
    
	assert(ps);
	
	return ps->top;

}


#include"Stack.h"

void tectStack()
{
    
	ST st;
	StackInit(&st);

	StackPush(&st, 1);
	StackPush(&st, 2);
	StackPush(&st, 3);
	StackPush(&st, 4);

	printf("%d ", StackTop(&st));

	StackPop(&st);
	printf("%d ", StackTop(&st));

	printf("\n打印\n");
	while (!StackEmpty(&st))
	{
    
		printf("%d ", StackTop(&st));
		StackPop(&st);
	}

	printf("\n");

	StackDestroy(&st);

}
int main()
{
    
	tectStack();

	return 0;

}