栈的相关操作

栈的相关操作

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAXN 100
#define OK 1
#define ERROR 0

typedef int BOOL;
typedef int Status;
typedef int DataType;
typedef struct Seqstack
{
	DataType data[MAXN];
	int top;
}Seqstack;

Status InitStack(Seqstack *s)
{
	s->top=-1;
	return OK;
}

Status ClearStack(Seqstack *s)
{
	memset(s->data,0,sizeof(s->data));
	s->top=-1;
	return OK;
}

BOOL StackEmpty(Seqstack s)
{
	if(s.top==-1)
		return 1;
	else
		return 0;
}

Status GetTop(Seqstack s,DataType *e)
{
	if(s.top==-1)
		return ERROR;
	(*e)=s.data[s.top];
	return OK;
}

Status Push(Seqstack *s,DataType e)
{
	if(s->top==MAXN-1)
		return ERROR;
	(s->top)++;
	s->data[s->top]=e;
	return OK;
}

Status Pop(Seqstack *s,DataType *e)
{
	if(s->top==-1)
		return ERROR;
	(*e)=s->data[s->top];
	(s->top)--;
	return OK;
}

int StackLength(Seqstack s)
{
	return s.top+1;
}

Status Display(Seqstack s)
{
	int i;
	if(s.top==-1)
		return ERROR;
	for(i=0;i<=s.top;i++)
		printf("%3d",s.data[i]);
	printf("\n");
	return OK;
}

void menu()
{
	printf("-----------------------------------\n");
	printf("             Menu      Version 1.0 \n");
	printf("-----------------------------------\n");
	printf("      1.InitStack      2.ClearStack\n");
	printf("      3.StackEmpty     4.GetTop    \n");
	printf("      5.Push           6.Pop       \n");
	printf("      7.StackLength    8.Display   \n");
	printf("      9.Quit                       \n");
	printf("-----------------------------------\n");
	printf("Please input your choice: ");
}

int main(int argc,char *argv[])
{
	DataType e;
	int choice;
	Seqstack s;
	while(1)
	{
		menu();
		scanf("%d",&choice);
		switch (choice)
		{
			case 1:
				if(InitStack(&s))
					printf("Init success!\n");
				else
					printf("Init failure!\n");
				break;
			case 2:
				if(ClearStack(&s))
					printf("Clear success!\n");
				else
					printf("Clear failure!\n");
				break;
			case 3:
				if(StackEmpty(s))
					printf("The stack is empty!\n");
				else
					printf("The stack is not empty!\n");
				break;
			case 4:
				if(GetTop(s,&e))
					printf("The top of the stack is: %d\n",e);
				else
					printf("Illegal operation!\n");
				break;
			case 5:
				printf("Please input the element you want to push:");
				scanf("%d",&e);
				if(Push(&s,e))
					printf("Push success!\n");
				else
					printf("Push failure!\n");
				break;
			case 6:
				if(Pop(&s,&e))
					printf("%d is popped out of the stack!\n",e);
				else
					printf("Illegal operation!\n");
				break;
			case 7:
				printf("The length of the stack is: %d\n",StackLength(s));
				break;
			case 8:
				Display(s);
				break;
			case 9:
				printf("Quit...\n");
				exit(0);
			default:
				printf("Illegal input!\n");
				break;
		}
	}

	return 0;
}