实验1.1.cpp

一些数据结构的基本实验的解法,和实用哦,欢迎借鉴,交流

#include<iostream.h>
#include"sqlist.h"
void main()
{	sqlist  L;
	int x,i,e,a=1,b,c;
	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(a)
		{	cout<<endl;
			cout<<"请输入一项操作（1/2/3/4/5/6/7/8/9/10）:"<<endl;
			cin>>x;
			switch(x)
			 { case 1:creat_sqlist(L);break;
			   case 2:cout<<"线形表的长度为："<<listlength_sq(L)<<endl;
				      break;
			   case 3:cout<<"请输入取线形表的第几个元素："<<endl;
				      cin>>b;
				      cout<<"所取得的元素为："<<getelem_sq(L,b,c);break;
			   case 4:cout<<"请输入一个数x,求线形表中第x个元素的前继:"<<endl;
			           cin>>b;
					   cout<<require_qianji(L,b);break;
			   case 5: cout<<"请输入一个数x,求线形表中第x个元素的后继:"<<endl;
			           cin>>b;
					   cout<<require_houji(L,b);break;
				   
			   case 6:cout<<"请输入一个数,在线形表中查找这个数:"<<endl;
					  cin>>b;
				       cout<<"此数在线形表的位置为："<<LocateElem_sq(L,b);break;
			   case 7:cout<<"请输入一个数,在线形表中插入这个数:"<<endl;
				      cin>>c;
				      cout<<"请输入在线形表中插入的位置："<<endl;
					  cin>>b;
					   cout<<Listinsert_sq(L,b+1,c);break;
					  
			   case 8: cout<<"请输入在线形表要删除的数的位置:"<<endl;
				       cin>>b;
					   cout<<Listdelete_sq(L,b)<<endl;
					   break;
					  
			   case 9:listkong_sq(L);break;
			   case 10: destroylist_sq(L);break;
			   case 11: a=0;
			}
	}

}