sqmain.cpp

数据结构基础代码

//实验1.1main函数
#include <iostream.h>
#include "Sqlist.h"
void main()
{
	sqlist l;
	int x,i,e,circle=1,mess;
	int choice;
	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;
	cout<<"9:判定一个顺序表是否为空表"<<endl;
	cout<<"10:置空顺序表"<<endl;
	cout<<"11:退出"<<endl;
	while(circle)
	{
		cout<<endl;
		cout<<"请选择您要执行的操作(1/2/3/4/.../11):"<<'\t';
		cin>>choice;
		switch(choice)
		{
		case 1:
			cout<<"请输入元素(输入0表示结束!):"<<endl;;
			creatlist_sq(l);
			cout<<"创建的线性表:"<<endl;
			outputlist_sq(l);
			break;
		case 2:	
			cout<<"线性表的长度是:"<<len_sq(l)<<endl;
			break;
		case 3:	
			cout<<"输入要查找元素的位序:"<<'\t';
			cin>>x;
			cout<<"要查找的元素是:"<<'\t';
			getelem(l,x);
			break;
		case 4:	
			int pre_e;
			cout<<"请输入您要查找前导元素的元素:"<<'\t';
			cin>>e;
			cout<<"此元素的前导元素是:"<<'\t';
			cout<<priorelem_sq(l,e);
			break;
		case 5:	
			int next_e;
			cout<<"输入要查找后继的元素:"<<'\t';
			cin>>e;
			cout<<"它后继元素是:"<<'\t';
			cout<<nextelem_sq(l,e);
			break;
		case 6:	
			cout<<"输入要查找的元素:"<<'\t';
			cin>>e;
			cout<<"此元素的位序是:"<<locateelem_sq(l,e)<<'\t';
			break;
		case 7:	
			cout<<"输入要插入的元素:"<<'\t';
			cin>>e;
			cout<<"输入要插入的元素的位序:"<<'\t';
			cin>>i;
			cout<<"插入元素后的线性表为:"<<'\t';
			listInsert_sq(l,i,e);
			break;
		case 8:	
			cout<<"输入要删除的元素的位序:"<<'\t';
			cin>>e;
			listdelete_sq(l,i);
			cout<<"删除后的线性表为:"<<'\t';
			outputlist_sq(l);
			break;
		case 9:
			chargeempty_sq(l);
			break;
		case 10:
			destroylist_sq(l);
			break;
		case 11:			circle=0;	break;
		}
	}



}