数据结构-C语言实现线性栈

#include<stdio.h>
#include<stdlib.h>
#define STACK_INIT_SIZE 100//存储空间初始化分配量
#define STACKINCREAMENT 10//存储空间分配增量
#define OK 1
#define OVERFLOW -1
#define FALSE 0
#define TURE 1
#define ERROR -1
typedef int Status;
typedef struct
{
	int *base;//在栈构造之前和销毁之后，base的值为NULL
	int *top;//栈顶指针
	int stacksize;//当前已分配的存储空间，以元素为单位
}SqStack;
//初始化栈
Status InitStack(SqStack *s)
{
	s->base=(int *)malloc(STACK_INIT_SIZE*sizeof(int));
	if(!s->base)exit(OVERFLOW);//存储分配失败
	s->top=s->base;
	s->stacksize=STACK_INIT_SIZE;
	return OK;
}
//获取栈顶元素
Status GetTop(SqStack s,int *e)
{
	if(s.top==s.base)
		return ERROR;
	*e=*(s.top-1);
	return OK;
}
//压栈
Status Push(SqStack *s,int e)
{
	if(s->top-s->base>=s->stacksize)//栈满
	{
		s->base=(int *)realloc(s->base,(s->stacksize+STACKINCREAMENT)*sizeof(int));
		if(!s->base)exit(OVERFLOW);//存储分配失败
		s->top=s->base+s->stacksize;
		s->stacksize+=STACKINCREAMENT;
	}
	*s->top=e;
	*s->top++;
	return OK;
}
//出栈
Status Pop(SqStack *s,int *e)
{
	if(s->base==s->top)
		return ERROR;
	*s->top--;//先移动栈顶指针，再赋值
	*e=*s->top;
	return OK;
}
//栈长度
int StackLength(SqStack s)
{
	return s.top-s.base;
}
//判断栈是否为空
Status StackEmpty(SqStack s)
{
	return s.base==s.top?OK:FALSE;
}
//清空顺序栈
Status CleanStack(SqStack *s){
s->top=s->base;
return OK;
}

void main()
{
	int ch=1;
	SqStack s;
	InitStack(&s);
	while(ch!=0)
	{
		system("cls");
		printf("1.初始化栈\t2.栈的长度\t3.栈的判空\n4.获取栈顶元素\t5.压栈\t6.出栈\n7.清空栈\n0.退出\n");
		printf("请选择:\n");
		scanf("%d",&ch);
		switch(ch)
		{
		case 0:printf("byebye!\n");
			break;
		case 1:{
				InitStack(&s);
				printf("初始化成功\n");
				break;
			   }
		case 2:
			{
				int length;
				length=StackLength(s);
				printf("栈的长度为%d\n",length);
				break;
			}
		case 3:
			{
				if(StackEmpty(s)==OK)
					printf("栈为空\n");
				else
					printf("栈不为空\n");
				break;
			}
		case 4:
			{
				int e;
				GetTop(s,&e);
				printf("栈顶元素为:%d\n",e);
				break;
			}
		case 5:
			{
				int e;
				printf("请输入你要压栈的数值:\n");
				scanf("%d",&e);
				if(Push(&s,e)==OK)
				printf("压栈成功\n");
				else
					printf("压栈失败\n");
				break;
			}
		case 6:
			{
				int e;
				if(Pop(&s,&e)==OK)
				printf("元素为:%d\n",e);
				else
					printf("出栈失败\n");
				break;
			}
		case 7:
			{
				if(CleanStack(&s)==OK)
					printf("清空成功\n");
				else
					printf("清空失败\n");
				 break;
			}
		default:
			printf("输入错误，请重新输入\n");
			break;
		}
		system("pause");
	}
}