栈的基本定义:栈是“先进后出”的性质,这是一种特殊的线性表,其实只允许在固定的一端进行插入或删除操作。进行数据插入和删除的一端称为栈顶,另一端称为栈底。但函数只能在栈顶操作。
一.定义结构体
typedef int STDataType;
typedef struct Stack
{
STDataType* a;
int capacity;
int top;
}ST;
如果想改变数据类型,就可以直接将int改为需要的数据类型。
二.初始化栈
void StackInit(ST* ps)//初试化
{
assert(ps);
ps->a = NULL;
ps->capacity = ps->top = 0;
}
三.进栈
void StackPush(ST* ps, STDataType x)//进栈
{
assert(ps);
if (ps->top == ps->capacity)
{
int newnoda = ps->capacity == 0 ? 4 : ps->capacity * 2;
STDataType* new = realloc(ps->a, sizeof(STDataType) * newnoda);
if (new == NULL)
{
printf("失败");
exit(-1);
}
else
{
ps->a = new;
ps->capacity = newnoda;
}
}
ps->a[ps->top] = x;
ps->top++;
}
一定要判断栈的内存,如果capacity和top相同那就得进行增容
四.出栈
void StackPop(ST* ps)//出栈
{
assert(ps);
assert(ps->top >0);
ps->top--;
}
五.栈顶的数据
STDataType StackTop(ST* ps)//栈顶的数据
{
assert(ps);
assert(!StackEmpty(ps));
return ps->a[ps->top-1];
}
六.判断栈是否为空
bool StackEmpty(ST* ps)//判断栈是否为空
{
assert(ps);
return ps->top == 0;
}
七.整体代码
stack.h
#pragma once
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
#include<stdbool.h>
typedef int STDataType;
typedef struct Stack
{
STDataType* a;
int capacity;
int top;
}ST;
void StackInit(ST* ps);//初试化
void StackDestory(ST* ps);//销毁
void StackPush(ST* ps,STDataType x);//进栈
void StackPop(ST* ps);//出栈
STDataType StackTop(ST* ps);//栈顶的数据
int StackSize(ST* ps);//栈中的数据个数
bool StackEmpty(ST* ps);//判断栈是否为空
stack.c
#define _CRT_SECURE_NO_WARNINGS 1
#include"stack.h"
void StackInit(ST* ps)//初试化
{
assert(ps);
ps->a = NULL;
ps->capacity = ps->top = 0;
}
void StackDestory(ST* ps)//销毁
{
assert(ps);
free(ps->a);
ps->a = NULL;
ps->capacity = ps->top = 0;
}
void StackPush(ST* ps, STDataType x)//进栈
{
assert(ps);
if (ps->top == ps->capacity)
{
int newnoda = ps->capacity == 0 ? 4 : ps->capacity * 2;
STDataType* new = realloc(ps->a, sizeof(STDataType) * newnoda);
if (new == NULL)
{
printf("失败");
exit(-1);
}
else
{
ps->a = new;
ps->capacity = newnoda;
}
}
ps->a[ps->top] = x;
ps->top++;
}
void StackPop(ST* ps)//出栈
{
assert(ps);
assert(ps->top >0);
ps->top--;
}
STDataType StackTop(ST* ps)//栈顶的数据
{
assert(ps);
assert(!StackEmpty(ps));
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;
}
test.c
#define _CRT_SECURE_NO_WARNINGS 1
#include "stack.h"
void test()
{
ST st;
StackInit(&st);
StackPush(&st, 1);
StackPush(&st, 2);
StackPush(&st, 3);
StackPush(&st, 4);
//StackPop(&st);
//printf("%d ", StackTop(&st));
//int a = StackSize(&st);
//printf("%d ", a);
while (!StackEmpty(&st))
{
printf("%d ", StackTop(&st));
StackPop(&st);
}
StackDestory(&st);
}
int main()
{
test();
return 0;
}