函数实现数据的插入(头插&&尾插)、删除(头删&&尾删)、查找、按位置插入、按位置删除、顺序表求长、顺序表清除、顺序表摧毁、数据的逆置以及数据排序
main函数
#include"SeqList.h"//顺序表
void main()
{
SeqList<int> mylist;
int select = 1;
int Item;
int pos;
while(select)
{
cout<<"**************************************"<<endl;
cout<<"* [1] push_back [2] push_front *"<<endl;
cout<<"* [3] show_list [0] quit_system*"<<endl;
cout<<"* [4] pop_back [5] pop_front *"<<endl;
cout<<"* [6] insert_pos [7] insert_val *"<<endl;
cout<<"* [8] delete_pos [9] delete_val *"<<endl;
cout<<"* [10] find [11]length *"<<endl;
cout<<"* [12] clear [13]destroy *"<<endl;
cout<<"* [14] reserv [15]sort *"<<endl;
cout<<"**************************************"<<endl;
cout<<"请选择:>";
cin>>select;
switch(select)
{
case 0:
mylist.quit_system();
break;
case 1:
cout<<"请输入要插入的值(-1结束):>";
while(cin>>Item, Item!=-1)
{
mylist.push_back(Item);
}
break;
case 2:
cout<<"请输入要插入的值(-1结束):>";
while(cin>>Item, Item!=-1)
{
mylist.push_front(Item);
}
break;
case 3:
mylist.show_list();
break;
case 4:
mylist.pop_back();
break;
case 5:
mylist.pop_front();
break;
case 6:
cout<<"请输入要插入的位置:>";
cin>>pos;
cout<<"请输入要插入的值:>";
cin>>Item;
mylist.insert_pos(pos,Item);
break;
case 7:
cout<<"请输入要插入的值:>";
cin>>Item;
mylist.insert_va

&spm=1001.2101.3001.5002&articleId=45967645&d=1&t=3&u=fe0881c54c5b47ef8fd0af00a527c506)
2227

被折叠的 条评论
为什么被折叠?



