#include <iostream>
#include <vector>
#include <unordered_map>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
vector<vector<int>>v;
vector<int>v1;
vector<int>v2;
vector<int>v3;
for(int i =0;i<3;i++)
{
v1.push_back(i);
v2.push_back(i+1);
v3.push_back(i+2);
}
cout << endl;
v.push_back(v1);
v.push_back(v2);
v.push_back(v3);
for(vector<vector<int>>::iterator it = v.begin();it != v.end();it++)
{
for(vector<int>::iterator vit = (*it).begin();vit != (*it).end();vit++)
{
cout << *vit << " ";
}
cout << endl;
}
cout << endl;
unordered_map<int,vector<int> >umap;
umap.emplace(1,v1);
cout << umap.size() << endl;
vector<int>w;
for(auto it = umap[1].begin();it!= umap[1].end();it++)
{
w.push_back(*it) ;
}
for(auto itr = w.begin();itr!=w.end();itr++)
{
cout << *itr << " ";
}
cout << endl;
for(unordered_map<int,vector<int>>::iterator ptr = umap.begin();ptr!= umap.end();ptr++)
{
cout << ptr->first << ":";
for(vector<int>::iterator it1 = ptr->second.begin();it1!=ptr->second.end();it1++)
{
cout << *it1 << " ";
}
cout << endl;
}
}
unorder_map<int,vector<int>>使用
最新推荐文章于 2024-06-20 16:44:13 发布