循环挂起迭代的 std::擦除 on std::list

我正在尝试使用哈希表删除存储在列表中的整数向量的重复组合。遍历列表中的每个整数向量，I：

1. 计算hash_value(塔什(
2. 查看哈希值是否已在哈希表中(pids(
3. 如果它在哈希表中，请从列表中擦除该向量。 否则，将该值添加到hash_table并递增列表 迭 代

打印语句似乎证实了我的逻辑，但循环在迭代的第四步挂起。我已经注释了导致问题的it++和vz.remove(it)，并且仅在下面的代码中显示逻辑。该代码也可通过 ideone： https://ideone.com/JLGA0f

#include<iostream>
#include<vector>
#include<list>
#include<cmath>
#include<unordered_set>
using namespace std;
double hash_cz(std::vector<int> &cz, std::vector<double> &lprimes) {
double pid = 0;
for(auto it = cz.begin(); it != cz.end(); it++) {
pid += lprimes[*it];
}
return pid;
}
int main(){
// create list of vectors
std::list<std::vector<int>> vz;
vz.push_back({2,1});
vz.push_back({1,2});
vz.push_back({1,3});
vz.push_back({1,2,3});
vz.push_back({2, 1});
// vector of log of prime numbers
std::vector<double> lprimes {2, 3, 5, 7};
for (auto it = lprimes.begin(); it != lprimes.end(); it++) {
*it = std::log(*it);
}
std::unordered_set<double> pids;
double thash;
for (auto it = vz.begin(); it != vz.end(); ) {
thash = hash_cz(*it, lprimes);
std::cout << thash << std::endl;
// delete element if its already been seen
if (pids.find(thash) != pids.end()) {
std::cout << "already present. should remove from list" << std::endl;
// vz.erase(it);
}
else {
// otherwise add it to hash_table and increment pointer
std::cout << "not present. add to hash. keep in list." << std::endl;
pids.insert(thash);
// it++;
}
it++;
}
for (auto it = vz.begin(); it != vz.end(); it++) {
for (auto j = it -> begin(); j != it -> end(); j++) {
std::cout << *j << ' ';
}
std::cout << std::endl;
}
return 0;
}