1.cpp

这是我的数据结构课程设计,经过我1周左右时间的润色,相信会对正在学习数据结构的人们有些用处

#include <iostream.h>
#include <iomanip.h>
#include "1.h"
void main()
{
  list< int > l;
  int i,x,element,k,key;
 
  cout<<"\n"<<"\n"<<endl;
  cout<<"欢迎使用顺序表动态演示系统"<<endl<<endl<<endl;
  cout<<"各键的操作如下:"<<endl<<endl;
  cout<<"1－建立顺序表"<<endl<<endl;
  cout<<"2－打印顺序表"<<endl<<endl;
  cout<<"3－插入元素"<<endl<<endl; 
  cout<<"4－删除元素"<<endl<<endl;
  cout<<"5－按地址查找元素"<<endl<<endl;
  cout<<"6－查找元素的地址"<<endl<<endl;
  cout<<"请选择您需要进行的操作\n"<<endl;
  
  while(cin>>key)
        switch(key)
		{
	case  1:
	       cout<<"请初始化长度为5的顺序表,"<<endl;
               for(  i = 0 ; i < max ; i++ )
			   {
	              cin>>x;
	              l.enter(i,x);
			   }
		   cout<<endl;
		break;
    case  2:
           cout<<"打印顺序表:"<<endl;
		   l.print();
		   cout<<endl;
	   break;
    case  3:
		   cout<<"请输入您要插入的元素:"<<endl;
		        cin>>element;
	       cout<<"请输入插入的序号"<<endl;
	            cin>>k;
	       l.insert(k,element);
		   cout<<"插入元素后的顺序表为:"<<endl;
		   l.print();
		   cout<<endl;
	   break;
	case  4:
		    cout<<"请输入您所要删除的元素序号"<<endl;
                cin>>x;
	        l.del(x);
            cout<<"删除该元素后的顺序表为: "<<endl;
            l.print();
			cout<<endl;
		break;
	case  5:
		    cout<<"请输入要查询元素的地址(序号)"<<endl;
                 cin>>x;
	        cout<<"第"<<x<<"个元素的值为"<<l.get(x)<<endl<<endl;
		 break;
	case  6:
		    cout<<"请输入您所要查询的元素"<<endl;
                cin>>x;
            cout<<"您所查询的元素序号为: "<<l.locate(x)<<endl<<endl;
		 break;
	default:
		    cout<<"sorry!无此操作"<<endl<<endl;
            break;
  }
}