map和struct的多重嵌套

多重嵌套

struct Node1
{
  int data1;
  int data2;
};
 
struct Node
{
  int key;
  map<int,Node1> myMap1;
};
 
 
//map中有Node,Node中有myMap1,myMap1中有Node1,則要想myMap中插入元素，必須由裡到外指派或插入
int main()
{
  //向myMap中插入元素
  map<int,Node> myMap;
  map<int, Node>::iterator it;
  map<int, Node1>::iterator it1;
 
  int p1 = 4,p=5;
  Node1 N1 = {1,2};
  
  Node N;
  N.key = 3;
  N.myMap1.insert(pair<int, Node1>(p1, N1));
 
  myMap.insert(pair<int, Node>(p, N));
  
  //周遊myMap
  for (it = myMap.begin(); it != myMap.end(); it++)
  {
    printf("%d\n",it->first);
    printf("%d\n", it->second.key);
    for (it1 = it->second.myMap1.begin(); it1 != it->second.myMap1.end(); it1++)
    {
      printf("%d\n", it1->first);
      printf("%d\n", it1->second.data1);
      printf("%d\n", it1->second.data2);
    }
  } 
 
  return 0;
}      

5
3
4 
1
2