统一C语言风格定义各种数据结构及基本操作——栈基本操作

/*stack.h*/
#pragma once
/*
采用顺序表存储栈中元素
*/
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>

#define STACK_INIT_SIZE 10        //初始化栈的容量
#define STACK_INCREASEMENT 2      //每次增加的栈的容量
typedef int ElemType;

typedef struct SqStack {
	ElemType* base;//栈底指针
	ElemType* top;//栈顶指针（指向下一次插入元素的位置）
	int stacksize;//栈的容量
}SqStack,*pSqStack;
//初始化栈
int initStack(pSqStack ps)
{
	ps->base = (ElemType*)malloc(sizeof(ElemType)*STACK_INIT_SIZE);
	if (!ps->base)return 0;
	ps->top = ps->base;
	ps->stacksize = STACK_INIT_SIZE;
	return 1;
}
//销毁栈
void destroyStack(pSqStack ps)
{
	if (ps != NULL) {
		free(ps->base);
		ps->top = ps->base=NULL;
		ps->stacksize = 0;
	}
}
//清空栈
void clearStack(pSqStack ps)
{
	ps->top = ps->base;
}
//判断栈是否为空，空则返回1，不空返回0
int isEmptyStack(pSqStack ps)
{
	if (ps->base==ps->top)return 1;
	return 0;
}
//获取栈中元素个数
int lengthStack(pSqStack ps)
{
	if (ps->base != NULL&&ps->top != NULL)
		return ps->top - ps->base;
	return 0;
}
//获取栈顶元素，成功返回1，不成功返回0
int getTopStack(pSqStack ps,ElemType& e)
{
	if (ps->base != ps->top) { 
		e = *(ps->top - 1); 
		return 1; 
	}
	return 0;
}
//入栈，成功返回1，不成功返回0
int pushStack(pSqStack ps, ElemType e)
{
	if (ps->top - ps->base >= ps->stacksize) {//栈满，扩充栈
		ps->base = (ElemType*)realloc(ps->base,sizeof(ElemType)*(ps->stacksize + STACK_INCREASEMENT));
		if (!ps->base)return 0;
		ps->top = ps->base + ps->stacksize;//重新开辟空间后需要重新指定栈顶指针
		ps->stacksize += STACK_INCREASEMENT;//栈容量
	}
	*(ps->top++) = e;//top指针永远指向下一个需要插入元素的位置（先插入元素，top指针再后移）
	return 1;
}
//出栈，成功返回1，不成功返回0
int popStack(pSqStack ps, ElemType& e)
{
	if (ps->base == ps->top)return 0;//栈空
	e = *(--ps->top);
	return 1;
}
//遍历栈
void traverseStack(pSqStack ps, void(*callback)(ElemType))
{
	ElemType* base = ps->base;
	while (ps->top != base)
		callback(*(base++));
	printf("\n");
}
void print(ElemType e)
{
	printf("%d ", e);
}

/*main.cpp*/
#include"stack.h"

int main()
{
	SqStack s;
	int i=0,e,state;

	state = initStack(&s);
	if (state)
		printf("初始化栈成功！\n");
	else
		printf("初始化栈失败！\n");

	printf("向栈顶压入元素(-999结束)!\n");
	while (1) {
		printf("压入第%d个元素：",(++i));
		scanf("%d", &e);
		if (e == -999)break;
		state=pushStack(&s, e);
		if (!state) {
			printf("压栈失败!\n");
			break;
		}
	}
	printf("遍历栈中元素为:");
	traverseStack(&s,print);
	printf("栈容量：%d\n", s.stacksize);
	printf("栈大小：%d\n", lengthStack(&s));

	state=popStack(&s, e);
	if (state)
		printf("\n出栈成功！\n");
	else
		printf("\n出栈失败！\n");
	printf("弹出栈顶元素为:%d\n", e);
	printf("遍历栈中元素为:");
	traverseStack(&s, print);

	printf("栈容量：%d\n", s.stacksize);
	printf("栈大小：%d\n", lengthStack(&s));

	printf("\n清空栈!\n");
	clearStack(&s);
	printf("栈容量：%d\n", s.stacksize);
	printf("栈大小：%d\n", lengthStack(&s));

	printf("\n销毁栈!\n");
	destroyStack(&s);
	printf("栈容量：%d\n", s.stacksize);
	printf("栈大小：%d\n", lengthStack(&s));

	return 1;
}