#include <map>
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
map<int,string> myMap;
// 4种插入方式
myMap[1] = "bbb";
myMap.insert(pair<int, string>(2, "ccc"));
myMap.insert(make_pair(3, "aaa"));
myMap.insert(map<int, string>::value_type(4, "ddd"));
for (auto it : myMap) { // 只读迭代器
cout << it.first << " " << it.second << endl;
}
cout << "----------------" << endl;
// 几种擦除方式
myMap.erase(1);
auto it2 = myMap.find(2);
if (it2 != myMap.end()) {
myMap.erase(it2);
}
for (map<int, string>::iterator it = myMap.begin(); it != myMap.end(); it++) {
cout << it->first << " " << it->second << endl;
}
cout << "----------------" << endl;
// 判断元素是否存在
if (myMap.count(3)) {
cout << "键3存在" << endl;
}
auto it3 = myMap.find(4);
if (it3 != myMap.end()) {
cout << "键4存在" << endl;
}
myMap.size(); // 获取元素个数
myMap.clear(); // 清空容器
//sort(myMap.begin(), myMap.end()); // map不能用sort函数,map会自动排序
system("pause");
}