31. Next Permutation

Posted 2021-02-14 ymjyqsx

https://www.cnblogs.com/grandyang/p/4428207.html

按照博客的思路在做就好，唯一值得注意的一点：如果整个数组都没有 nums[i+1] > nums[i]，你就需要把整个数组reverse

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