本文共 3579 字，大约阅读时间需要 11 分钟。
参考文献：
#include #include #include using namespace std;int main(){//删除某个元素 erase()： map mapStu; mapStu.insert(map ::value_type(1, "stu1")); mapStu.insert(map ::value_type(2, "stu2")); mapStu.insert(pair (3, "stu3")); map ::iterator itor; itor = mapStu.find(1); mapStu.erase(2); //根据键值删除某个元素 //mapStu.erase(itor); //根据迭代器删除 //mapStu.erase(mapStu.begin(), mapStu.end()); //删除一个范围内的 for (itor = mapStu.begin(); itor != mapStu.end(); itor++) cout << itor->second < mapStu; mapStu.insert(map ::value_type(1, "stu1")); mapStu.insert(map ::value_type(2, "stu2")); mapStu.insert(pair (3, "stu3")); map ::iterator itor; itor = mapStu.find(3); if (itor != mapStu.end()) cout << itor->second << endl; //stu3 itor = mapStu.lower_bound(1); if (itor != mapStu.end()) cout << itor->second << endl; //stu1 itor = mapStu.upper_bound(1); if (itor != mapStu.end()) cout << itor->second << endl; //stu2 itor = mapStu.lower_bound(2); if (itor != mapStu.end()) cout << itor->second << endl; //stu2 itor = mapStu.upper_bound(2); if (itor != mapStu.end()) cout << itor->second << endl; //stu3 pair , map > pairStu; pairStu = mapStu.equal_range(2); //equal_range(2) if (pairStu.first == pairStu.second) cout << "不存在" << endl;*///数组形式遍历 /*map mapStu; mapStu.insert(map ::value_type(1, "stu1")); mapStu.insert(map ::value_type(2, "stu2")); mapStu.insert(pair (3, "stu3")); int nsize = mapStu.size(); for (int size = 1; size <= nsize; size++) cout << mapStu[size] << endl;*///反向遍历 //map mapStu; //mapStu.insert(map ::value_type(1, "stu1")); //mapStu.insert(map ::value_type(2, "stu2")); //mapStu.insert(pair (3, "stu3")); //pair ::iterator, bool> pair_insert; //pair_insert = mapStu.insert(pair (3, "stu4")); //if (pair_insert.second == true) // cout << "success" << endl; //else // cout << "fail" << endl; //map ::reverse_iterator itor; //for (itor = mapStu.rbegin(); itor != mapStu.rend(); itor++) // cout << itor->first << " " << itor->second << endl; //int size = mapStu.size(); //cout << size << endl;//关于是否能够替换:数组方式2 //map mapStu; //mapStu.insert(map ::value_type(1, "stu1")); //mapStu.insert(map ::value_type(2, "stu2")); //mapStu.insert(pair (3, "stu3")); //pair ::iterator, bool> pair_insert; //pair_insert = mapStu.insert(pair (3, "stu4")); //if (pair_insert.second == true) // cout << "success" << endl; //else // cout << "fail" << endl; //map ::iterator itor; //for (itor = mapStu.begin(); itor != mapStu.end(); itor++) // cout << itor->first << " " << itor->second < mapStu; //mapStu[1] = "stu0"; //mapStu[2] = "stu1"; //mapStu[3] = "stu2"; //mapStu[3] = "stu3"; //输出替换了stu2 //map ::iterator itor; //for (itor = mapStu.begin(); itor != mapStu.end(); itor++) // cout << itor->second << endl;//方法3 //map mapStu; //mapStu[1] = "stu0"; //mapStu[2] = "stu1"; //mapStu[3] = "stu2"; //map ::iterator itor; //for (itor = mapStu.begin(); itor != mapStu.end(); itor++) // cout << itor->first << endl;//方法2// map mapStu;// mapStu.insert(map ::value_type(1, "stu1")); // mapStu.insert(map ::value_type(2, "stu2"));// mapStu.insert(map ::value_type(3, "stu3"));// map ::iterator iter;// for (iter = mapStu.begin(); iter != mapStu.end(); iter++)// cout << iter->second << endl;//方法1 /*map mapStu; mapStu.insert(pair (1, "stu1")); mapStu.insert(pair (2, "stu2")); mapStu.insert(pair (3, "stu3")); map ::iterator inter; for (inter = mapStu.begin(); inter != mapStu.end(); inter++) cout << inter->first << endl;*/ system("pause"); return 0;}
转载于:https://www.cnblogs.com/weiyouqing/p/9307758.html