在C++中使用STL算法的简便方法

#include<algorithm>
#include<vector>
#include<iostream>

std::vector<int> v = {3, 1, 4, 1, 5, 9};
std::sort(v.begin(), v.end());
for (int i : v) {
    std::cout << i << " ";
}

std::vector<int> v = {3, 1, 4, 1, 5, 9};
auto it = std::find(v.begin(), v.end(), 4);
if (it != v.end()) {
    std::cout << "Found: " << *it<< std::endl;
} else {
    std::cout << "Not found"<< std::endl;
}

std::vector<int> v = {3, 1, 4, 1, 5, 9};
int count = std::count(v.begin(), v.end(), 1);
std::cout << "Count: "<< count<< std::endl;

std::vector<int> v = {3, 1, 4, 1, 5, 9};
auto max_it = std::max_element(v.begin(), v.end());
auto min_it = std::min_element(v.begin(), v.end());
std::cout << "Max: " << *max_it<< std::endl;
std::cout << "Min: " << *min_it<< std::endl;

std::vector<int> v = {3, 1, 4, 1, 5, 9};
std::sort(v.begin(), v.end());
auto it = std::unique(v.begin(), v.end());
v.erase(it, v.end());
for (int i : v) {
    std::cout << i << " ";
}

std::vector<int> v = {3, 1, 4, 1, 5, 9};
std::random_device rd;
std::mt19937 g(rd());
std::shuffle(v.begin(), v.end(), g);
for (int i : v) {
    std::cout << i << " ";
}