LeetCode Next Permutation

标签：

Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.

If such arrangement is not possible, it must rearrange it as the lowest possible order (ie, sorted in ascending order).

The replacement must be in-place, do not allocate extra memory.

Here are some examples. Inputs are in the left-hand column and its corresponding outputs are in the right-hand column.
1,2,3 → 1,3,2
3,2,1 → 1,2,3
1,1,5 → 1,5,1

思路：以前做过的一道一样的：题解

class Solution {
public:
    void nextPermutation(vector<int> &num) {
        if (num.size() < 2) return;
        int i = num.size() - 2;
        while (num[i] >= num[i+1] && i != -1) i--;
        if (i < 0) {
            reverse(num.begin(), num.end());
            return;
        }
        int j = num.size() - 1;
        while (num[j] <= num[i]) j--;
        swap(num[i], num[j]);
        reverse(num.begin() + i + 1, num.end());
    }
};

LeetCode Next Permutation

标签：

原文地址：http://blog.csdn.net/u011345136/article/details/43926581