map-有序 multimap-可重复 unordered_map-无序

#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <algorithm>
using namespace std;

void OutPut(char val)
{
    cout << val << ' ';
}

int main(int argc, char const *argv[])
{
    vector<char> cVec;
    cVec.push_back('Z');
    cVec.push_back('D');
    cVec.push_back('W');
    cVec.push_back('S');
    cVec.push_back('J');
    cVec.push_back('A');
    cVec.push_back('U');

    cout << "用C++11 for(:)进行遍历" << endl;
    cout << "向量排序前:\n";
    for(auto x : cVec){
        OutPut(x);
    }

    // algorithm内的函数模板 底层还是for(begin,!=end)
    cout << endl << endl << "用algorithm内的函数模板for_each进行遍历:" << endl;
    for_each(cVec.begin(), cVec.end(), [](char val){cout << val << ' ';});
    //for_each(cVec.begin(), cVec.end(), OutPut);

    // 排序
    sort(cVec.begin(), cVec.end());
    cout << endl << endl << "向量排序后:\n";
    for(auto x : cVec){
        OutPut(x);
    }
    // for_each(cVec.begin(), cVec.end(), OutPut);  // algorithm内的函数模板

    // map
    cout << endl;
    cout << endl;
    cout << "map示例：" << endl;
    map<int, int> imap;
    //multimap<int, int> imap;
    //unordered_map<int, int> imap;
    //imap.insert(unordered_map<int, int>::value_type(100, 1000));
    
    // 三种方式插入
    imap.insert(make_pair(1, 10));
    imap.insert(make_pair(4, 40));
    imap.insert(make_pair(5, 50));
    imap.insert(make_pair(9, 90));
    imap.insert(map<int, int>::value_type(8, 800));
    imap.insert(pair<int,int>(2,20));

    // 如果需要更改值的话，用引用for(auto& it : imap)
    for(auto it : imap)
    {
        cout << "Key:" << it.first << " --> Value:" << it.second << "\n";
    }

    cout << endl;
	system("pause");
    return 0;
}

转载于:https://www.cnblogs.com/jadeshu/p/10663519.html