【LeetCode】【HOT】31. 下一个排列

【LeetCode】【HOT】31. 下一个排列

package hot;

import java.util.Arrays;

public class Solution31 {
    public static void main(String[] args) {
        int[] nums = {1,2,3,8,5,7,6,4};
        Solution31 solution = new Solution31();
        solution.setNums(nums);
        solution.method();
        System.out.println(Arrays.toString(solution.getNums()));
    }

    int[] nums;

    public int[] getNums() {
        return nums;
    }

    public void setNums(int[] nums) {
        this.nums = nums;
    }

    private void method(){
        int i = nums.length - 2;
        while(i >= 0 && nums[i] >= nums[i + 1]){
            i--;
        }
        if(i >= 0){
            int j = nums.length - 1;
            while(j >= 0 && nums[i] >= nums[j]){
                j--;
            }
            swap(i, j);
        }
        reverse(i + 1);
    }

    private void swap(int i, int j){
        int temp = nums[i];
        nums[i] = nums[j];
        nums[j] = temp;
    }

    private void reverse(int start){
        int left = start;
        int right = nums.length - 1;
        while(left < right){
            swap(left,right);
            left++;
            right--;
        }
    }
}

//时间复杂度为 O(n)
//空间复杂度为 O(1)