main.cpp

数据结构基础代码

#include <iostream.h>
#include "sqStack.h"
#include "LinkStack.h"
sqstack s;
linkstack top;
void main()
{
	int a=1,b=1;
	int x,y;
	cout<<"1.顺序存储结构:"<<endl;
	cout<<"2.链式存储结构:"<<endl;
	cout<<"3.退出"<<endl;
	while(a)
	{
	cout<<endl;
	cout<<"请在1-3中选择一个数值:"<<endl;
	cin>>x;
	switch(x)
	{	
	case 1:
		cout<<"顺序存储结构栈的操作演示"<<'\t'<<endl;
		cout<<"您可以选择的操作是:"<<endl;
		cout<<"1. 初始化"<<endl;
		cout<<"2. 求长度"<<endl;
		cout<<"3. 获取栈顶元素"<<endl;
		cout<<"4. 压栈"<<endl;
		cout<<"5. 出栈"<<endl;
		cout<<"6. 判空"<<endl;
		cout<<"7. 置空栈"<<endl;
		cout<<"8. 退出"<<endl;
		while(b)
		{
			cout<<endl;
			cout<<"请在1-8中选择一个数值:";
			cin>>y;
			switch(y)
			{
			case 1:
				int i;
				cout<<"初始化操作!"<<endl;
				initstack(s);
				creatstack(s);
				for(i=0;i<=s.top;++i)
				{
					cout<<s.elem[i]<<'\t';
				}
				cout<<endl;
				break;
			case 2:
				cout<<"栈中元素的个数是:"<<lengthstack(s);
				cout<<endl;
				break;
			case 3:
				cout<<"栈顶元素是:"<<topelemstack(s);
				cout<<endl;
				break;
			case 4:
				int push;
				cout<<"压栈的元素值是:";
				cin>>push;
				pushstack(s,push);
				for(i=0;i<=s.top;++i)
				{
					cout<<s.elem[i]<<'\t';
				}
				cout<<endl;
				break;
			case 5:
				cout<<"出栈的元素是:"<<popstack(s);
				cout<<endl;
				break;
			case 6:
				chargestack(s);
				cout<<endl;
				break;
			case 7:
				emptystack(s);
				cout<<endl;
				break;
			case 8:
				cout<<"已退出!"<<endl;
				b=0;
				break;
			}
			
		}
		break;
	case 2:
		cout<<"链式存储结构栈的操作演示"<<endl;
		cout<<"您可以选择的操作是:"<<endl;
		cout<<"1. 初始化"<<endl;
		cout<<"2. 求长度"<<endl;
		cout<<"3. 获取栈顶元素"<<endl;
		cout<<"4. 压栈"<<endl;
		cout<<"5. 出栈"<<endl;
		cout<<"6. 判空"<<endl;
		cout<<"7. 置空栈"<<endl;
		cout<<"8. 退出"<<endl;
		while(b)
		{
			cout<<endl;
			cout<<"请在1-8中选择一个数值:";
			cin>>y;
			switch(y)
			{
			case 1:
				int n,i;
				cout<<"输入元素个数:";
				cin>>n;
				linkstack p;
				p=top;
				lcreatstack(top,n);
				cout<<endl;
				break;
			case 2:
				int num;
				num=llengthstack(top);
				cout<<"栈中元素的个数是:"<<num;
				cout<<endl;
				break;
			case 3:
				cout<<"栈顶元素是:"<<ltopelemstack(top);
				cout<<endl;
				break;
			case 4:
				int push;
				cout<<"压栈的元素值是:";
				cin>>push;
				lpushstack(top,push);
				cout<<endl;
				break;
			case 5:
				cout<<"出栈的元素是:"<<lpopstack(top);
				cout<<endl;
				break;
			case 6:
				lchargestack(top);	
				break;
			case 7:
				cout<<"置空后的栈内元素是:"<<endl;
				lemptystack(top);
				cout<<endl;
				break;
			case 8:
				cout<<"已退出!"<<endl;
				b=0;
				break;
				
			}
		}
		break;
	case 3:
		a=0;
		break;
	}
	}
}