main.cpp

数据结构基础代码

//单链表的基本操作
#include <iostream.h>
#include "List.h"
linklist l;
void main()
{
	int x,i=1;
	int choice;
	cout<<"选择执行的操作:"<<endl;
	cout<<"===========================================================\n";
	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;
	cout<<"=============================================================\n";
	while(i)
	{
		cout<<endl;
		cout<<"请选择您要执行的操作:"<<'\t';
		cin>>choice;
		switch(choice)
		{
		case 1:
			int n;
			cout<<"输入元素的个数:";
			cin>>n;
			cout<<"输入元素(Enter表示结束!):"<<endl;
			creatlist(l,n);
			break;
		case 2:
			int length;
			length=lengthlist(l);
			cout<<"链式表的长度是:"<<length<<endl;
			lengthlist(l);
			break;
		case 3:	
			lnode *q;
			cout<<"输入要取出的元素的位序:";
			cin>>x;
			cout<<"要查找的元素是:"<<getlnode(l,x);
			break;
		case 4:	
			int pre;
			cout<<"输入元素(求前导):";
			cin>>pre;
			cout<<"它的前导元素是:"<<prelnode(l,pre)<<endl;
			break;
		case 5:	
			int k,post;
			cout<<"选择下列的元素求后继:";
				traverselist(l,lengthlist(l)-1);
			cout<<endl;
			cout<<"输入元素(求后继):";
			cin>>post;
			k=postlnode(l,post);
			cout<<"它的后继元素是:"<<k<<endl;
			break;
		case 6:
			int e;
			cout<<"输入查找的元素:";
			cin>>e;
			cout<<"此元素在链表的位序是:"<<findlnode(l,e)<<endl;
			break;
		case 7:
			int i;
			lnode *s;
			s=new lnode;
			cout<<"输入插入元素的位序:";
			cin>>i;
			cout<<"输入插入的结点的值:";
			cin>>s->data;
			insertlnode(l,i,s);
			break;
		case 8:
			int t;
			cout<<"输入删除元素的位序:";
			cin>>t;
			deletelnode(l,t);
			break;
		case 9:
			chargelist(l);
			break;
		case 10:
			emptylist(l);
			cout<<"置空后的链式表:";
			traverselist(l,lengthlist(l));
			break;
		case 11:			
			i=0;	
			break;
			cout<<"========================================================";
		}
	}
}