map的坑

最新推荐文章于 2023-11-24 00:44:37 发布

rockets311

最新推荐文章于 2023-11-24 00:44:37 发布

阅读量965

点赞数

分类专栏：一步一步CPP

本文链接：https://blog.csdn.net/cxb_phoenix/article/details/51442397

版权

一步一步CPP 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<unordered_map>
using namespace std;
int main(){
    std::unordered_map<int,int> mm;
    mm[3];
    mm.insert(pair<int,int>(1,2));
    mm.insert(pair<int,int>(1,5));
    mm.insert(pair<int,int>(2,3));
    for(auto it = mm.begin(); it != mm.end();it ++ ){
        cout << it->first << " : " << it->second << endl;
    }
    return 0;
}

1.[]操作符
2.map特性：Inserts element(s) into the container, if the container doesn't already contain an element with an equivalent key.