jQuery火箭图标返回顶部代码

Vector:

#include "stdafx.h"
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
    vector<int> v = { 10,98,76,66,67,66,90 };
    cout << "排序前的数组: ";
    for (int elem : v) {
        cout << elem << " ";            //如何输出
    }
    cout << endl;
    stable_sort(v.begin(), v.end());    //此排序方式为稳定排序，适用于v中有相同元素，如上面有2个66的情况，
                                        //这样就不会改变两个66的相对位置。如果没有重复元素的话，用sort(v.begin(), v.end())方可  
    cout << "排序后的数组: ";
    for (int elem : v) {
        cout << elem << " ";            //如何输出
    }
    cout << endl;
    fill(v.begin()+2, v.end(), 54);    //填充
    cout << "此时的数组:   ";           
    for (int elem : v) {
        cout << elem << " ";            //如何输出
    }
    cout << endl;
    fill_n(v.begin(), 3, 8);           //填充的另一种方式
    cout << "此时的数组:   ";
    for (int elem : v) {
        cout << elem << " ";            //如何输出
    }
    cout << endl;
    return 0;
}

对于上述输出方式的演变如下:现在用(3)即可

(1)

for_each (int elem in v) 
{
       cout << elem << " ";  
}

(2)

for_each (v.begin(),v.end(),[](int elem) 
{
       cout << elem << " "; 
}

(3)

for (int elem : v) 
{
       cout << elem << " ";
}

字符串大写变小写:

#include "stdafx.h"
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
    string s1 = "hello world.";
    string s2;
    transform(s1.begin(), s1.end(), s2.begin(), toupper);   //同样大写变小写就是tolower
    cout << s1 << endl;
}

二分查找:

#include "stdafx.h"
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
    vector<int> v= { 10,98,76,45,66,67,90 };
    if (binary_search(v.begin(), v.end(),67))
        cout << "Exits!" << endl;
    else
        cout << "Didn't exits!" << endl;
}

数列反转:

#include "stdafx.h"
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
    vector<int> v= { 10,98,76,45,66,67,90 };
    cout << "反转前的数列为: ";
    for (int elem : v) 
    {
        cout << elem << " ";  
    }
    cout << endl;
    reverse(v.begin(), v.end());
    cout << "反转后的数列为: ";
    for (int elem : v) 
    {
        cout << elem << " "; 
    }
    cout << endl;
    return 0;
}

条件分区:

#include "stdafx.h"
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
    vector<int> v = { 1,2,3,4,5,6,7,8,9 };
    stable_partition(v.begin(), v.end(), [](int elem)
    {
        return elem % 2 == 0;
    }); 
    for (int elem : v)
    {
         cout << elem << " ";
    }
    cout << endl;
    return 0;
}

运行结果：