zoukankan      html  css  js  c++  java
  • STL

    // create vector with elements from 1 to 6 in arbitrary order
        vector<int> coll = { 2, 5, 4, 1, 6, 3 };
    
        // find and print minimum and maximum elements
        auto minpos = min_element(coll.cbegin(), coll.cend());
        cout << "min: " << *minpos << endl;
        auto maxpos = max_element(coll.cbegin(), coll.cend());
        cout << "max: " << *maxpos << endl;
    
        cout << "original vector:" << endl;
        ContainerUtil<vector<int>>::printElements(coll);
        // sort all elements
        sort(coll.begin(), coll.end());
        cout << "after sorting:" << endl;
        ContainerUtil<vector<int>>::printElements(coll);
        
        // find the first element with value 3
        // - no cbegin()/cend() because later we modify the elements pos3 refers to
        auto pos3 = find(coll.begin(), coll.end(), 3);                     
    
        // reverse the order of the found element with value 3 and all following elements
        reverse(pos3, coll.end());
        cout << "after reverse from the position of value 3:" << endl;
        ContainerUtil<vector<int>>::printElements(coll);

    运行结果:

    min: 1
    max: 6
    original vector:
      2  5  4  1  6  3
    after sorting:
      1  2  3  4  5  6
    after reverse from the position of value 3:
      1  2  6  5  4  3

  • 相关阅读:
    一个maven问题
    zz 聊聊并发(七)——Java中的阻塞队列
    聊聊并发(六)
    jvm 内存参数
    zz 聊聊并发(五)
    zz 聊聊并发(四)
    zz 聊聊并发(三)
    zz 聊聊并发(二)
    zz 聊聊并发(一)
    JQuery中$.ajax()方法参数详解
  • 原文地址:https://www.cnblogs.com/davidgu/p/4755644.html
Copyright © 2011-2022 走看看