LeetCode 31. Next Permutation

LeetCode 31. 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 and use only constant 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>& nums) {
        int flag = 0;
        for(int i = nums.size()-1 ; i > 0; i--){
            if(nums[i] > nums[i-1]){
                flag = i;
                break;
            }
        }
        if(!flag)
            reverse(nums.begin(),nums.end());
        else{
            sort(nums.begin()+flag,nums.end());
            for(int i = flag-1 ;i<nums.size(); i++){
                if(nums[i] > nums[flag-1]){
                    swap(nums[i],nums[flag-1]);
                    break;
                }
            }
        }
    }
};