next_permutation和prev_permutation

next_permutation用于生成当前序列的下一个排列组合，如果当前序列是最大值则返回false；

prev_permutation用于生成当前序列的上一个排列组合，如果当前序列是最小值则返回false。

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

using namespace std;

int main()
{
    vector<int> v{ 1,2,3 };
    vector<int> v2{ 3,2,1 };

    do {
        copy(v.begin(), v.end(), ostream_iterator<int>{cout, " "});
        cout << std::endl;
    } while (next_permutation(v.begin(), v.end(), [](int i, int j) { return i < j; }));
    cout << endl;

    do {
        copy(v.begin(), v.end(), ostream_iterator<int>{cout, " "});
        cout << std::endl;
    } while (prev_permutation(v.begin(), v.end(), [](int i, int j) { return i > j; }));
    cout << endl;

    do {
        copy(v2.begin(), v2.end(), ostream_iterator<int>{cout, " "});
        cout << std::endl;
    } while (next_permutation(v2.begin(), v2.end(), [](int i, int j) { return i > j; }));
    cout << endl;

    do {
        copy(v2.begin(), v2.end(), ostream_iterator<int>{cout, " "});
        cout << std::endl;
    } while (prev_permutation(v2.begin(), v2.end(), [](int i, int j) { return i < j; }));
    cout << endl;

    return 0;
}

输出结果：

1 2 3
1 3 2
2 1 3
2 3 1
3 1 2
3 2 1

1 2 3
1 3 2
2 1 3
2 3 1
3 1 2
3 2 1

3 2 1
3 1 2
2 3 1
2 1 3
1 3 2
1 2 3

3 2 1
3 1 2
2 3 1
2 1 3
1 3 2
1 2 3