[C++] map–usage

Search by key:

map<char,int>::iterator it;
it = mymap.find('b');
if (it != mymap.end())
    //found!
else
    //not found!

Traversal

for(iter = mapStudent.begin(); iter != mapStudent.end(); iter++)
    cout<<iter->first<<" "<<iter->second<<endl;

Sorting:

bool compFunc(pair<char, int=""> a, pair<char, int=""> b) {
   //sort whatever you want (by key, value or both)
}
map<char, int> lan_list;
vector< pair<char, int> > sort_tmp(lan_list.begin(), lan_list.end());
sort(sort_tmp.begin(), sort_tmp.end(), compFunc);

發佈留言

發佈留言必須填寫的電子郵件地址不會公開。 必填欄位標示為 *