zoukankan      html  css  js  c++  java
  • [ ] 自动插入map

    performing an insertion if such key does not already exist.

    #include <iostream>
    #include <map>
     
    int main()
    {
        std::map<char, int> letter_counts;
     
        letter_counts['a'];
        for(auto& [k,v]: letter_counts) {
            std::cout<<k <<", "<<v<<std::endl; 
        }
        std::cout<<"-------------------"<<std::endl;
        letter_counts['b'];
        for(auto& [k,v]: letter_counts) {
            std::cout<<k <<", "<<v<<std::endl; 
        }
        std::cout<<"-------------------"<<std::endl;
        letter_counts['a']=1;
        for(auto& [k,v]: letter_counts) {
            std::cout<<k <<", "<<v<<std::endl; 
        }
        std::cout<<"-------------------"<<std::endl;
        letter_counts['a'];
        for(auto& [k,v]: letter_counts) {
            std::cout<<k <<", "<<v<<std::endl; 
        }
        std::cout<<"-------------------"<<std::endl;
    
        return 0;
    }
    

    output:

    a, 0
    
    -------------------
    
    a, 0
    
    b, 0
    
    -------------------
    
    a, 1
    
    b, 0
    
    -------------------
    
    a, 1
    
    b, 0
    
    -------------------
    
  • 相关阅读:
    37. 解数独
    皮尔逊相关系数的计算以及数据的描述性统计
    商业微信小程序开发实战---1
    51. N皇后
    拟合算法
    216. 组合总和 III
    打印心性
    指针
    第五天
    循环 和 宏
  • 原文地址:https://www.cnblogs.com/Searchor/p/15465938.html
Copyright © 2011-2022 走看看