顺序栈的9个基本操作

顺序栈的9个基本操作

定义常量

/*一些经常用到的头文件，预定义常量等*/
//常用头文件
#include <stdio.h>
#include <malloc.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
//函数结果状态代码
#define TRUE	1
#define FALSE	0
#define OK		1
#define ERROR	0
#define INFEASIBLE	0
//新建函数类型，表示函数运行结果
typedef int Status;

结构体定义和函数声明

//顺序栈结构体定义
#define STACK_INIT_SIZE 30
#define STACKINCREMENT 10
typedef struct
{
	SElemType* base;
	SElemType* top;
	int stacksize;
}SqStack;

//顺序栈9个基本操作和1个辅助函数的函数声明

//构造空栈 
Status InitStack(SqStack* S);
//销毁栈
Status DestroyStack(SqStack* S);
//置空栈
Status ClearStack(SqStack* S);
//判栈空
Status StackEmpty(SqStack S);
//求栈长
int StackLength(SqStack S);
//取栈顶元素，用e返回 
Status GetTop(SqStack S, SElemType* e);
//压栈
Status Push(SqStack* S, SElemType e);
//出栈
Status Pop(SqStack* S, SElemType* e);
//遍历栈
Status StackTraverse(SqStack S, Status(*visit)(SElemType*));
//辅助函数
Status visit(SElemType* e);

函数定义

//顺序栈的9个基本操作函数定义
//构造空栈
Status InitStack(SqStack* S)
{
	S->base = (SElemType*)malloc(STACK_INIT_SIZE * sizeof(SElemType));
	if (!S->base)
	{
		printf("创建失败！\n");
		exit(-1);
	}
	S->top = S->base;
	S->stacksize = STACK_INIT_SIZE;
	return OK;
}

//销毁栈
Status DestroyStack(SqStack* S)
{
	free(S->base);
	S->base = NULL;
	S->top = NULL;
	S->stacksize = 0;
	return OK;
}

//置空栈
Status ClearStack(SqStack* S)
{
	S->top = S->base;
	return OK;
}

//判栈空
Status StackEmpty(SqStack S)
{
	if (S.top == S.base)
		return TRUE;
	else
		return FALSE;
}

//求栈长
int StackLength(SqStack S)
{
	return S.stacksize;
}

//取栈顶元素，用e返回 
Status GetTop(SqStack S, SElemType* e)
{
	if (S.top == S.base)
		return ERROR;
	else
	{
		*e = *(S.top - 1);
		return OK;
	}
}

//压栈
Status Push(SqStack* S, SElemType e)
{
	//如果栈满，扩充
	if (S->top - S->base >= S->stacksize)
	{
		//此处注意realloc引起内存泄漏问题
		SElemType *temp = (SElemType*)realloc(S->base, (S->stacksize + STACKINCREMENT) * sizeof(SElemType));
		if (!temp)	exit(ERROR);
		S->base = temp;
		S->top = S->base + S->stacksize;
		S->stacksize += STACKINCREMENT;
	}
	*(S->top) = e;
	S->top++;
	return OK;
}

//出栈
Status Pop(SqStack* S, SElemType* e)
{
	if (S->top == S->base)
		return ERROR;
	S->top--;
	*e = *S->top;
	return OK;
}

//遍历栈
Status StackTraverse(SqStack S, Status(*visit)(SElemType*))
{
	while (S.top != S.base)
	{
		S.top--;
		visit(S.top);
	}
	printf("\n");
	return OK;
}

测试

//顺序栈基本操作测试
int main()
{
	//初始化栈
	SqStack S;
	InitStack(&S);
	if (StackEmpty(S))
		printf("空栈！\n");
	else
		printf("不是空栈！\n");
	//压栈
	SElemType i;
	for (i = 1; i <= 100; i++)
	{
		Push(&S, i);
	}
	StackTraverse(S, visit);
	//长度
	printf("栈长：%d\n", StackLength(S));
	//获取顶元素
	SElemType x;
	GetTop(S, &x);
	printf("顶元素：%d\n", x);
	//出栈 
	SElemType e;
	if (Pop(&S, &e))
		printf("出栈成功：%d\n", e);
	else
		printf("出栈失败！\n");
	if (Pop(&S, &e))
		printf("出栈成功：%d\n", e);
	else
		printf("出栈失败！\n");
	StackTraverse(S, visit);
	//置空栈 
	if (ClearStack(&S))
		printf("置空成功！\n");
	else
		printf("置空失败！\n");
	if (StackEmpty(S))
		printf("空栈！\n");
	else
		printf("不是空栈！\n");
	//销毁栈 
	if (DestroyStack(&S))
		printf("销毁成功！\n");
	else
		printf("销毁失败！\n");

	return 0;
}


//辅助函数
Status visit(SElemType* e)
{
	printf("%d ", *e);
	return OK;
}

运行结果