1.构建二维数组
vector<int> v(m,vector<int>(n,0));
2.map插入键(键自动排序):
mp.insert(make_pair(vk[i],vv[i]));
3.map遍历
map<int, int>::iterator iter;
iter = mp.begin();
while(iter != _mp.end()) {
cout << iter->first << " : " << iter->second << endl;
iter++;
}
4.map查找key是否存在
if(mp.count(key)>0)
{
return mp[key];
}
return null;
//
map<char,int>::iterator iter = mp.find(key);
if(iter!=mp.end())
{
return iter->second;
}
return null;
4.map值排序
map<char,int> cnt
multimap<int,char>_cnt;
for(map<char,int>::iterator itr = cnt.begin();itr!=cnt.end();itr++)
{
_cnt.insert(make_pair(itr->second,itr->first));
//pair<char,int>(itr->second,itr->first)
}
5.优先队列
priority_queue <int,vector<int>,less<int> > p;
priority_queue <int,vector<int>,greater<int> > q;
6.string 类型单个字符转换为char类型进行比较
#include <iostream>
using namespace std;
int main()
{
string s="s";
char k='s';
if(s.data()[0]==k) //s.data()是转换为字符串之后的首地址,可以视为一个字符数组
cout<<"1"<<endl;
else
cout<<"0"<<endl;
return 0;
}