【Lintcode】52. Next Permutation

题目地址：

https://www.lintcode.com/problem/next-permutation/description

给定一个数组，求其按照字典序从小到大的下一个全排列。如果不存在，则返回字典序最小的全排列。

参考https://blog.csdn.net/qq_46105170/article/details/108460153。代码如下：

public class Solution {
    /**
     * @param nums: A list of integers
     * @return: A list of integers
     */
    public int[] nextPermutation(int[] nums) {
        // write your code here
        if (nums == null || nums.length == 0) {
            return nums;
        }
        
        int i = nums.length - 1;
        while (i > 0 && nums[i - 1] >= nums[i]) {
            i--;
        }
        
        if (i == 0) {
            reverse(nums, 0, nums.length - 1);
            return nums;
        }
        
        int l = i, r = nums.length - 1;
        while (l < r) {
            int m = l + (r - l + 1 >> 1);
            if (nums[m] > nums[i - 1]) {
                l = m;
            } else {
                r = m - 1;
            }
        }
        
        swap(nums, i - 1, l);
        reverse(nums, i, nums.length - 1);
        
        return nums;
    }
    
    private void reverse(int[] nums, int l, int r) {
        while (l < r) {
            swap(nums, l, r);
            l++;
            r--;
        }
    }
    
    private void swap(int[] nums, int i, int j) {
        int tmp = nums[i];
        nums[i] = nums[j];
        nums[j] = tmp;
    }
}

时间复杂度$O(n)$，空间$O(1)$。