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:
    int firstDecrease(vector<int>& nums)//从后往前第一个降序，返回较小元素的下标
    {
        int i = nums.size() - 1;
        for (; i > 0; --i)
        {
            if (nums[i - 1] < nums[i])
            {
                break;
            }
        }
        
        return i - 1;//返回-1说明已经是最大的字典序了
    }
    
    
    int firstLarger(vector<int>& nums, int idx)//返回从后往前找到第一个比nums[idx]大的元素的下标
    {
        int i = nums.size() - 1;
        for (; i > idx; --i)
        {
            if (nums[i] > nums[idx])
            {
                break;
            }
        }
        
        return i;
    }
    
    void reverse(vector<int>& nums, int a, int b)//翻转，a，b都是下标
    {
        while (a < b) 
        {
            std::swap(nums[a], nums[b]);
            ++a;
            --b;
        }
    }
    
    void nextPermutation(vector<int>& nums) {
        if (nums.size() < 2)//边界情况
        {
            return;
        }
        //1.找第一个降序
        int d = firstDecrease(nums);
        if (d < 0)
        {
            //最大的字典序，直接对数组反转得到最小的字典序
            reverse(nums, 0, nums.size() - 1);
            return;
        }
        //2.找第一个比降序对象大的
        int l = firstLarger(nums, d);
        //交换
        std::swap(nums[d], nums[l]);
        //3.下标d后面的子数组翻转
        reverse(nums, d + 1, nums.size() - 1);
    }
};