字典map要点

小学期学的算法和做OJ题的各种经验总结

pair

pair<type, type> p; 
pair<type, type> p2(val,val); 
p.first; p.second;

map<char, int> m;
//插入
//1.
m['b'] = 2;
//2.
m.insert(make_pair('a',1));

//查找
//1.
puts(m['a']);
//2.
map<char, int>::iterator it;
it = m.find(key);
//(1)
puts(it->second);
//(2)
if(it != m.end())
	puts(it->second);

//遍历
for (map<char,int>::iterator it=mymap.begin(); it!=mymap.end(); ++it)
    cout << it->first << " : " << it->second << '\n';