|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
|
/************************************************************************** Map的特点: 1、存储Key-value对* 2、支持快速查找，查找的复杂度基本是Log(N)* 3、快速插入，快速删除，快速修改记<strong>*</strong>/************************************************************************/#include <iostream>#include <string>#include <map> using namespace std;int main(){ map<const char*,int> m; m["a"]=1; m["b"]=6; m["c"]=9; map<const char*,int>::iterator it; it=m.begin(); const char* c =it->first; cout<<"first element is :"<<c<<endl; int i = m["c"]; while(it!=m.end()){ cout << it->first<<";"<<it->second<<endl; ++it; } cout <<"m[\"c\"]="<<i<<endl; cout <<"sizeof m:"<<m.size()<<endl; cout <<"erase m[\"c\"](1:succ 0:failed):"<<m.erase("c")<<endl; cout <<"erase m[\"c\"]:"<<m.erase("c")<<endl; cout <<"sizeof m:"<<m.size()<<endl; cout<<"m[c]="<<m["c"]<<endl; cout<<"sizeof m :"<<m.size()<<endl; return 0;} |
运行结果
以上就是小编为大家带来的深入了解C++中map用法全部内容了，希望大家多多支持服务器之家~
