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

  • 相关阅读:
    jUnit4初探(1)
    关于冒泡排序与选择排序
    我对直接插入排序的一点理解
    Java中的Scanner类
    String数组与字符串类
    Redis知识点详解
    MySQL操作命令详解
    java中常见面试题整理
    Redis的安装部署
    zookeeper的伪集群部署步骤
  • 原文地址:https://www.cnblogs.com/davidgu/p/4755644.html
Copyright © 2011-2022 走看看