STL——容器(List)List 的数据元素插入和删除操作

不打扰是莪最后的温柔 提交于 2020-10-02 10:40:54

push_back(elem);

//在容器尾部加入一个元素

 1 #include <iostream>
 2 #include <list>
 3 
 4 using namespace std;
 5 
 6 int main()
 7 {
 8     int num[] = { 111,222,333 };
 9     list<int> listInt(num, num + size(num));
10     cout << "初始遍历 listInt:";
11     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
12     {
13         cout << *it << " ";
14     }
15     cout << endl;
16 
17     listInt.push_back(444);
18     cout << "push_back后遍历 listInt:";
19     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
20     {
21         cout << *it << " ";
22     }
23     cout << endl;
24 
25     return 0;
26 }

打印结果:

 

 

 

pop_back();

//删除容器中最后一个元素

 1 #include <iostream>
 2 #include <list>
 3 
 4 using namespace std;
 5 
 6 int main()
 7 {
 8     int num[] = { 111,222,333 };
 9     list<int> listInt(num, num + size(num));
10     cout << "初始遍历 listInt:";
11     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
12     {
13         cout << *it << " ";
14     }
15     cout << endl;
16 
17     listInt.pop_back();
18     cout << "pop_back 后遍历 listInt:";
19     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
20     {
21         cout << *it << " ";
22     }
23     cout << endl;
24 
25     return 0;
26 }

打印结果:

 

 

 

 

push_front(elem);

//在容器开头插入一个元素

 1 #include <iostream>
 2 #include <list>
 3 
 4 using namespace std;
 5 
 6 int main()
 7 {
 8     int num[] = { 111,222,333 };
 9     list<int> listInt(num, num + size(num));
10     cout << "初始遍历 listInt:";
11     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
12     {
13         cout << *it << " ";
14     }
15     cout << endl;
16 
17     listInt.push_front(0);
18     cout << "push_front 后遍历 listInt:";
19     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
20     {
21         cout << *it << " ";
22     }
23     cout << endl;
24 
25     return 0;
26 }

打印结果:

 

 

 

 

pop_front();

//从容器开头移除第一个元素

 1 #include <iostream>
 2 #include <list>
 3 
 4 using namespace std;
 5 
 6 int main()
 7 {
 8     int num[] = { 111,222,333 };
 9     list<int> listInt(num, num + size(num));
10     cout << "初始遍历 listInt:";
11     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
12     {
13         cout << *it << " ";
14     }
15     cout << endl;
16 
17     listInt.pop_front();
18     cout << "pop_front 后遍历 listInt:";
19     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
20     {
21         cout << *it << " ";
22     }
23     cout << endl;
24 
25     return 0;
26 }

打印结果:

 

 

 

 

insert(pos, elem);

//在pos位置插elem元素的拷贝,返回新数据的位置

这里需要注意一点,list 不可以随机存取元素,所以不支持 at.(position)函数与[]操作符。可以对其迭代器执行++和--,但是不能这样操作迭代器:it + 3

 1 #include <iostream>
 2 #include <list>
 3 
 4 using namespace std;
 5 
 6 int main()
 7 {
 8     int num[] = { 111,222,333 };
 9     list<int> listInt(num, num + size(num));
10     cout << "初始遍历 listInt:";
11     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
12     {
13         cout << *it << " ";
14     }
15     cout << endl;
16 
17 
18     cout << "insert 后,用 insert 的返回值遍历 listInt:";
19     for (list<int>::iterator it = listInt.insert(++listInt.begin(), 888); it != listInt.end(); it++)
20     {
21         cout << *it << " ";
22     }
23     cout << endl;
24     cout << "最终遍历 listInt:";
25     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
26     {
27         cout << *it << " ";
28     }
29 
30     return 0;
31 }

打印结果:

 

 

 

 

insert(pos, n, elem);

//在pos位置插入n个elem数据,返回新数据的第一个数据的位置(这个有没有返回值是编译器版本决定,早起版本的编译器没有返回值)

这里需要注意一点,list 不可以随机存取元素,所以不支持 at.(position)函数与[]操作符。可以对其迭代器执行++和--,但是不能这样操作迭代器:it + 3

 1 #include <iostream>
 2 #include <list>
 3 
 4 using namespace std;
 5 
 6 int main()
 7 {
 8     int num[] = { 111,222,333 };
 9     list<int> listInt(num, num + size(num));
10     cout << "初始遍历 listInt:";
11     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
12     {
13         cout << *it << " ";
14     }
15     cout << endl;
16 
17     
18     cout << "insert 后,用 insert 的返回值遍历 listInt:";
19     for (list<int>::iterator it = listInt.insert(++listInt.begin(), 2, 888); it != listInt.end(); it++)
20     {
21         cout << *it << " ";
22     }
23     cout << endl;
24     cout << "最终遍历 listInt:";
25     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
26     {
27         cout << *it << " ";
28     }
29 
30     return 0;
31 }

打印结果:

 

 

 

 

 

insert(pos, beg, end);

//在pos位置插入[beg,end)区间的数据,下面代码我举两种使用方法,一种是使用迭代器插入,另一种是插入数组

这里需要注意一点,list 不可以随机存取元素,所以不支持 at.(position)函数与[]操作符。可以对其迭代器执行++和--,但是不能这样操作迭代器:it + 3

 1 #include <iostream>
 2 #include <list>
 3 
 4 using namespace std;
 5 
 6 int main()
 7 {
 8     int num[] = { 111,222,333 };
 9     int num_1[] = { 666,777,888 };
10     list<int> listInt(num, num + size(num));
11     list<int> listInt_A(2, 666);
12     cout << "初始遍历 listInt:";
13     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
14     {
15         cout << *it << " ";
16     }
17     cout << endl;
18 
19     
20     cout << "insert 后,用 insert 的返回值遍历 listInt:";
21     for (list<int>::iterator it = listInt.insert(++listInt.begin(), listInt_A.begin(), listInt_A.end()); it != listInt.end(); it++)
22     {
23         cout << *it << " ";
24     }
25 
26     cout << endl;
27     cout << "最终遍历 listInt:";
28     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
29     {
30         cout << *it << " ";
31     }
32     cout << endl << endl;
33 
34 
35     //当然这里也可以插入数组
36     cout << "使用 insert 插入数组,然后用 insert 的返回值遍历 listInt:" << endl;
37     for (list<int>::iterator it = listInt.insert(++listInt.begin(), num_1, num_1 + size(num_1)); it != listInt.end(); it++)
38     {
39         cout << *it << " ";
40     }
41 
42     cout << endl;
43     cout << "最终遍历 listInt:";
44     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
45     {
46         cout << *it << " ";
47     }
48 
49     return 0;
50 }

打印结果:

 

 

 

 

clear();

//移除容器的所有数据

 1 #include <iostream>
 2 #include <list>
 3 
 4 using namespace std;
 5 
 6 int main()
 7 {
 8     int num[] = { 111,222,333 };
 9     list<int> listInt(num, num + size(num));
10     cout << "clear 前遍历 listInt:";
11     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
12     {
13         cout << *it << " ";
14     }
15     cout << endl;
16     cout << "clear 前 listInt.size() = " << listInt.size() << endl;
17 
18 
19     listInt.clear();
20     cout << "clear 后遍历 listInt:";
21     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
22     {
23         cout << *it << " ";
24     }
25     cout << endl;
26     cout << "clear 后 listInt.size() = " << listInt.size() << endl;
27 
28     return 0;
29 }

打印结果:

 

 

 

 

erase(beg, end);

//删除[beg,end)区间的数据,返回下一个数据的位置

 1 #include <iostream>
 2 #include <list>
 3 
 4 using namespace std;
 5 
 6 int main()
 7 {
 8     int num[] = { 111,222,333,444,555,666 };
 9     list<int> listInt(num, num + size(num));
10     cout << "erase 前遍历 listInt:";
11     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
12     {
13         cout << *it << " ";
14     }
15     cout << endl;
16 
17     
18     cout << "erase 后,用其返回值遍历 listInt:";
19     for (list<int>::iterator it = listInt.erase(++listInt.begin(), --listInt.end()); it != listInt.end(); it++)
20     {
21         cout << *it << " ";
22     }
23 
24     cout << endl;
25     cout << "erase 后遍历 listInt:";
26     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
27     {
28         cout << *it << " ";
29     }
30 
31     return 0;
32 }

打印结果:

 

 

 

 

erase(pos);

//删除pos位置的数据,返回下一个数据的位置

 1 #include <iostream>
 2 #include <list>
 3 
 4 using namespace std;
 5 
 6 int main()
 7 {
 8     int num[] = { 111,222,333,444,555,666 };
 9     list<int> listInt(num, num + size(num));
10     cout << "erase 前遍历 listInt:";
11     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
12     {
13         cout << *it << " ";
14     }
15     cout << endl;
16 
17     
18     cout << "erase 后,用其返回值遍历 listInt:";
19     for (list<int>::iterator it = listInt.erase(++listInt.begin()); it != listInt.end(); it++)
20     {
21         cout << *it << " ";
22     }
23 
24     cout << endl;
25     cout << "erase 后遍历 listInt:";
26     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
27     {
28         cout << *it << " ";
29     }
30 
31     return 0;
32 }

打印结果:

 

 

 

remove(elem);

//删除容器中所有与elem值匹配的元素

 1 #include <iostream>
 2 #include <list>
 3 
 4 using namespace std;
 5 
 6 int main()
 7 {
 8     int num[] = { 111,222,111,333,111,444 };
 9     list<int> listInt(num, num + size(num));
10     cout << "erase 前遍历 listInt:";
11     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
12     {
13         cout << *it << " ";
14     }
15     cout << endl;
16 
17     listInt.remove(111);
18     cout << "remove 后遍历 listInt:";
19     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
20     {
21         cout << *it << " ";
22     }
23 
24     return 0;
25 }

打印结果:

 还有一种遍历删除法:

 1 #include <iostream>
 2 #include <list>
 3 
 4 using namespace std;
 5 
 6 int main()
 7 {
 8     int num[] = { 111,222,111,333,111,444 };
 9     list<int> listInt(num, num + size(num));
10     cout << "erase 前遍历 listInt:";
11     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
12     {
13         cout << *it << " ";
14     }
15     cout << endl;
16 
17     for (list<int>::iterator it = listInt.begin(); it != listInt.end();)
18     {
19         if (*it == 111)
20         {
21             it = listInt.erase(it);
22         }
23         else
24         {
25             it++;
26         }
27     }
28 
29     cout << "erase 后遍历 listInt:";
30     for (list<int>::iterator it = listInt.begin(); it != listInt.end(); it++)
31     {
32         cout << *it << " ";
33     }
34 
35     return 0;
36 }

打印结果:

 

 

 

 

 

 

 

 

======================================================================================================================

 

标签
易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!