shuxuzhan.cpp

这是一个比较基础的数据结构的实例代码

#include "stdio.h"
#define maxlength 11
struct seqstack
{
	int s[maxlength];
	int top;
};
struct seqstack stack;

void setnull()
{
	stack.top=0;
}

void print()
{
	int i;
	printf("\n The elements of stack is:");
	for(i=1;i<stack.top+1;i++)
		printf("%5d",stack.s[i]);
}

void empty()
{
	if(stack.top==0)
       printf("\n 空栈");
	else
		printf("\n 不是空栈");
}

void push()
{
	int data;
	printf("\n Please input an element:");
	scanf("%d",&data);
	do{
		if(stack.top==maxlength)
			printf("\n overflow");
		else
		{
			stack.top=stack.top+1;
			stack.s[stack.top]=data;
		}
		printf("\n please input  an element:");
		scanf("%d",&data);
	}while(data!=-1);
}

void pop()
{  
	if (stack.top==0) 
		printf("\n 栈为空\n");
	else
	{
		printf("删除栈中的元素\n");
		for(int i=maxlength-1;i>0;i--)
			printf("%5d",stack.s[i]);
	}
	printf("\n");
}

void top()
{
	int data;
	if(stack.top==0)
		printf("\n underflow");
	else
	{
		data=stack.s[stack.top];
		printf("\n the top element is %d",data);
        printf("\n the top is %d \n",stack.top);
	}
}

void main()
{
	int k;
	printf("\n 设定空栈,栈顶元素为:");
	printf("%d",stack.top);
	setnull();
	printf("\n\n the empty stack is:");
	for(k=1;k<maxlength;k++)
		printf("%5d",stack.s[k]);
	printf("\n\n please input enter the stack data,");
	printf("\n\n if input -1 quit\n");
	push();
	empty();
	print();
	top();
	pop();
	top();
	pop();
	top();
	print();
}