哈希表
#include<unordered_map>
#include<bits/stdc++.h>
using namespace std;
int main(){
unordered_map<string,int> w1;
unordered_map<string,int> w2={{"a",1}};
w1["b"]=2;
w2.insert({"c",3});
w1.erase(w1.begin());
w1.erase(w1.begin(),w1.end());
w2.erase("c");
for(auto i=w2.begin();i!=w2.end();i++){
cout<<i->first<<" "<<i->second<<endl;
}
cout<<w2.size()<<endl;
w1.clear();
return 0;
}
哈希集
unordered_set<int> hashset;
hashset.insert(3);
hashset.insert(4);
hashset.erase(3);
hashset.count();
for (auto it = hashset.begin(); it != hashset.end(); ++it) {
cout << (*it) << " ";
}