[LeetCode] Next Permutation

[Problem]

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

[Analysis]
ms直接使用C++的next_permutation(iterator first, iterator last);就可以了。

[Solution]

class Solution {
public:
    void nextPermutation(vector<int> &num) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        next_permutation(num.begin(), num.end());
    }
};

说明：版权所有，转载请注明出处。Coder007的博客