1.删除value是大写的map
#include<bits/stdc++.h>
using namespace std;
//当我们删除了 it_pos 之后,it_pos 这个迭代器已经失效了,对其进行 it_pos++ 操作,
//就是未知的操作,会引起异常。所以我们应该在删除 it_pos 之前就对其进行 ++。改成下面的代码就可以解决问题了。
//c++ 11 之后,删除迭代器会返回指向下一个位置的迭代器
void erase_upper(std::map<int, char>& m) {
map<int ,char>::iterator m1_Iter;
for( m1_Iter = m.begin(); m1_Iter!=m.end(); ){
if( m1_Iter->second >= 'A' && m1_Iter->second <= 'Z' ){
m1_Iter = m.erase(m1_Iter);
//m.erase(m1_Iter++);
}else{
m1_Iter++;
}
}
map<int ,char>::iterator m2_Iter;
for( m2_Iter = m.begin(); m2_Iter != m.end(); m2_Iter++ ){
cout<<m2_Iter->second;
}
}
int main()
{
map<int, char> m ;
m[1] = 'a';
m[2] = 'B';
m[3] = 'C';
m[4] = 'D';
m[5] = 'e';
erase_upper(m);
return 0;
}
2.map 求 学生各科目的平均数
#include<bits/stdc++.h>
using namespace std;
/*
{{1,91},{1,92},{2,93},{2,97},{1,60},{2,77},{1,65},{1,87},{1,100},{2,100},{2,76}}
{{1,87},{2,88}}
第一列是学生是id,第二列是学生的成绩平均数
*/
int main()
{
int num[11][2] = {{1,91},{1,92},{2,93},{2,97},{1,60},{2,77},{1,65},{1,87},{1,100},{2,100},{2,76}};
int m=11,n=2;
int idNum = m/5;
vector<vector<int>> vec(idNum,vector<int>(2));
unordered_map<int,vector<int>> ma;
vector<int> v;
for(int i=0; i<m; i++)
{
if(ma.find(num[i][0]) == ma.end())
{
vector<int> tmp;
tmp.push_back(num[i][1]);
//ma.insert(num[i][0],tmp);
//ma.insert(pair<int, vector<int>(num[i][0],tmp));
ma[num[i][0]] = tmp;//原理
//ma.insert({num[i][0],tmp});
}
else
{
ma[num[i][0]].push_back(num[i][1]);
//ma.insert(num[i][0],v);
//unordered_map<int,vector<int>>::iterator ittmp = ma.find(num[i][0]);
//ittmp->second.push_back(num[i][1]);
}
}
int total = 0;
int res = 0;
for(auto it = ma.begin(); it!=ma.end(); ++it)
{
idNum = it->first;
//v = it->second;
//sort(v.begin(),v.end());
//reverse(v.begin(),v.end());
sort(it->second.begin(),it->second.end());
reverse(it->second.begin(),it->second.end());
for(int i=0; i<it->second.size(); i++){
cout<<it->second[i]<<",";
}
for(int j=0; j<5; j++)
{
total += it->second[j];
}
res = total/5;
vec[idNum-1][0] = idNum; // 这里不能写vec[idNum][0] = idNum;下标记得减一
vec[idNum-1][1] = res;
total = 0;
}
cout<<endl;
for(int i=0; i<vec.size(); i++){
cout<<vec[i][0]<<":"<<vec[i][1]<<endl;
}
return 0;
}