三天一题-28-Next Permutation

题目地址：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
说明:
由指定几个数组成一个数字，求在几个数字的组合比当前数字大组合中的最小的那一个组合，如果没有，则按返回最小值。
要求：除常数空间外，不能使用额外的空间。
例如123，比它大的有132,213,231,321,312,这这些组合中，最小的132.
答案借鉴：https://leetcode.com/problems/next-permutation/discuss/13872/Easiest-JAVA-Solution

import com.sun.deploy.util.ArrayUtil;

import java.util.Arrays;

public class NextPermutation {


    public static void main(String[] args) {
        // int[] ints ={6,5,4,1,0};
        int[] ints = {5, 4, 2, 1};
        int[] res = nextPermutation(ints);
        System.out.println(Arrays.toString(res));
    }

    private static void swap(int[] nums, int param1, int param2) {
        nums[param1] = nums[param1] ^ nums[param2];
        nums[param2] = nums[param1] ^ nums[param2];
        nums[param1] = nums[param1] ^ nums[param2];
    }
    //两头进行翻转
    private static void reverse(int[] nums, int param1, int param2) {
        while (param1 < param2) swap(nums, param1++, param2--);
    }

    public static int[] nextPermutation(int[] nums) {
        int len = nums.length;
        int index = len - 1;
        while (index > 0 && nums[index] < nums[index - 1]) index--;
        index = --index;
        //找到满足条件的值
        if (index > -1) {
            int j = len - 1;
            while (nums[index] < nums[j]) j--;
            swap(nums, index, j - 1);
        }
        //统一进行排序
        reverse(nums, index + 1, len - 1);
        return nums;
    }

}