leetcode31（方法借鉴来自leetcode上面的）记录刷题

方法一：

 public void nextPermutation(int[] nums) {

        for(int i=nums.length-1;i>0;i--){

            if(nums[i]>nums[i-1]){

                Arrays.sort(nums,i,nums.length);

                for(int j=i;j<nums.length;j++){

                    if(nums[j]>nums[i-1]){

                        int temp=nums[j];

                        nums[j]=nums[i-1];

                        nums[i-1]=temp;

                        return;

                    }

                }

            }

        }

        Arrays.sort(nums);

        return;

    }

方法二：

public void nextPermutation(int[] nums) {
        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--;
            }
           int temp=nums[i];

nums[i]=nums[j];

nums[j]=temp;
        }
        reverse(nums, i + 1);
    }

    public void reverse(int[] nums, int start) {
        int left = start, right = nums.length - 1;
        while (left < right) {
 f

     int temp=nums[i];

nums[i]=nums[j];

nums[j]=temp;

            left++;
            right--;
        }
    }