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 
     
  • 相关阅读:
    周赛F题 POJ 1458(最长公共子序列)
    HDU 4720 Naive and Silly Muggles 2013年四川省赛题
    HDU 4716 A Computer Graphics Problem 2013年四川省赛题
    SCU 4440 Rectangle 2015年四川省赛题
    SCU 4436 Easy Math 2015年四川省赛题
    大数模板——六种实现了加减乘除和求余
    HDU 1002 A + B Problem II
    CodeForces 689C  Mike and Chocolate Thieves
    CodeForces 689A -Mike and Cellphone
    CodeForces 595B
  • 原文地址:https://www.cnblogs.com/zsb517/p/3388254.html
Copyright © 2011-2022 走看看