c++如何遍历删除map/vector里面的元素

新技能Get!

问题

对于c++里面的容器, 我们可以使用iterator进行方便的遍历. 但是当我们通过iterator对vector/map等进行修改时, 我们就要小心了, 因为操作往往会导致iterator失效, 之后的行为都变得不可预知. 比如:

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29

#include <iostream> #include <vector>   using namespace std;   int main() {     vector<int> a = {12, 23, 34, 45, 56, 67, 78, 89};           for (auto iter = a.begin(); iter != a.end(); ++iter) {         if (*iter > 30) {             a.erase(iter);         }     }           for (const auto &element : a) {         cout<<element<<endl;     }           return 0; }   输出:   12 23 45 67 89

cplusplus的reference里对 std::vector::erase 的描述是:

Iterators, pointers and references pointing to position (or first) and beyond are invalidated, with all iterators, pointers and references to elements before position (or first) are guaranteed to keep referring to the same elements they were referring to before the call.

只有删除元素前面的iterator还保持有效, 之后的遍历行为不可预知.

解决方案

对于vector, erase会返回下一个iterator, 因此我们可以使用如下的方法:

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

#include <iostream> #include <vector>   using namespace std;   int main() {     vector<int> a = {12, 23, 34, 45, 56, 67, 78, 89};           auto iter = a.begin();     while (iter != a.end()) {         if (*iter > 30) {             iter = a.erase(iter);         }         else {             ++iter;         }     }           for (const auto &element : a) {         cout<<element<<endl;     }           return 0; }     输出:   12 23

　　

对于map, 删除iterator只会影响当前的iterator, 因此使用for循环就够了, 比如:

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26

#include <iostream> #include <map>   using namespace std;   int main() {     map<int, int> a = {{1, 12}, {2, 23}, {3, 34}, {4, 45}, {5, 56}, {6, 67}};           for (auto iter = a.begin(); iter != a.end(); ++iter) {         if (iter->second > 30) {             a.erase(iter);         }     }           for (const auto &element : a) {         cout<<element.first<<" : "<<element.second<<endl;     }           return 0; }   输出:   1 : 12 2 : 23

　　但是更推荐的做法是在erase前让iterator指向下一个元素

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

#include <iostream> #include <map>   using namespace std;   int main() {     map<int, int> a = {{1, 12}, {2, 23}, {3, 34}, {4, 45}, {5, 56}, {6, 67}};           auto iter = a.begin();     while (iter != a.end()) {         if (iter->second > 30) {             a.erase(iter++);         }         else {             ++iter;         }     }           for (const auto &element : a) {         cout<<element.first<<" : "<<element.second<<endl;     }           return 0; }   输出:   1 : 12 2 : 23

　　

参考资料

http://stackoverflow.com/questions/4645705/vector-erase-iterator

http://stackoverflow.com/questions/4600567/how-can-i-delete-elements-of-a-stdmap-with-an-iterator