从零开始的LC刷题(123): 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

找到相同数字的排列组合中只比给出的序列大一点的数（所有可能的全排列从小到大排序后在给出序列后面一个的数），解法是先从右到左搜索，只要数字有下降，就是目标点，之后再把目标点与只比目标点大一点的数字交换，然后给目标点之后的所有数排序就行，结果：

Success

Runtime: 8 ms, faster than 75.52% of C++ online submissions for Next Permutation.

Memory Usage: 8.6 MB, less than 95.70% of C++ online submissions for Next Permutation.

代码：

class Solution {
public:
    void nextPermutation(vector<int>& nums) {
        int max=nums.size()-1;
        int i;
        for(i=nums.size()-2;i>=0;i--){
            if(nums[i]>=nums[max]){
                max=i;
                }
            else break;
            }
        if(i<0){sort(nums.begin(),nums.end());return;}
        int target=nums[i];
        int j;
        for(j=nums.size()-1;j>=0;j--){
            if(nums[j]>target){break;}
        }
        nums[i]=nums[j];
        nums[j]=target;
        sort(nums.begin()+i+1,nums.end());
        
    }
};