zoukankan      html  css  js  c++  java
  • 语艺杂谈1 – MAP赋值与插入

    MAP赋值和插入,对于相同ID的处理方式不同,前者为替换 后者为插入失败

    #include <map>
    #include <string>
    #include <iostream>
    using namespace std;
    int main()
    {
       map<int, string> mapStudent;
       pair<map<int, string>::iterator, bool> Insert_Pair;
       mapStudent[1] = "student_one";
       mapStudent[1] = "student_one2";   
       
       cout << "====================MAP  赋值测试=====================
    " <<endl ;
       map<int, string>::iterator  iter;
       for(iter = mapStudent.begin(); iter != mapStudent.end(); iter++)
       {
           cout<<iter->first<<" "<<iter->second<< endl;
       }
       
       cout << "====================MAP  INSERT测试=====================
    " <<endl ;
       Insert_Pair = mapStudent.insert(pair<int, string>(2, "student_2"));
       if(Insert_Pair.second == true)
       {
              cout<<"Insert Successfully"<<endl;
       }
       else
       {
              cout<<"Insert Failure"<<endl;
       }
       Insert_Pair = mapStudent.insert(pair<int, string>(2, "student_2222"));
       if(Insert_Pair.second == true)
       {
              cout<<"Insert Successfully"<<endl;
       }
       else
       {
              cout<<"Insert Failure"<<endl;
       }
       
       for(iter = mapStudent.begin(); iter != mapStudent.end(); iter++)
       {
           cout<<iter->first<<" "<<iter->second<< endl;
       }
    }
    image 
     
  • 相关阅读:
    [LeetCode] 199. Binary Tree Right Side View
    [LeetCode] 360. Sort Transformed Array
    [LeetCode] 146. LRU Cache
    [LeetCode] 28. Implement strStr()
    [LeetCode] 498. Diagonal Traverse
    [LeetCode] 545. Boundary of Binary Tree
    [LeetCode] 937. Reorder Data in Log Files
    软件开发之我剑!软件测试, 房子的刚性需求【原】
    c#调用Delphi的dll函数遇到的问题及解决方法
    C# 回调函数
  • 原文地址:https://www.cnblogs.com/zsb517/p/3388254.html
Copyright © 2011-2022 走看看