leetcode 31. 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

Accepted  268,943  Submissions 866,694

二 分析

这个题目求下一个排列顺序，假设你跟我一样不是很理解全排列的含义，可以简单理解找下一个大数。如果一开始就是降序（也就是数字已经是最大的），那么按照升序排列。

下面的图片吧步骤列出来了。比较清晰。代码我加了注释，比较好理解。

public static void main(String[] args) {
	    int[] nums= {1,2,3};
		nextPermutation(nums);
		 int[] nums1= {1,1,5};
		nextPermutation(nums1);
		 int[] nums2= {3,2,1};
			nextPermutation(nums2);
	}

	public static void nextPermutation(int[] nums) {
		//conner case
		if(nums== null|| nums.length==1){
			return;
		}
		//从右向左找：前面小于后面的数
       
        int p = -1;
        int q = -1;
        for( int i= nums.length-1;i>0;i--){
        	if(nums[i-1]<nums[i]){
        		p= i-1;
        		//从右向左查找第一个比p大
        		for(int j=nums.length-1;j>=i;j-- ){
        			
        			if(nums[j]>nums[p]){
        				q= j;
        				break;
        			}        			
        		}
        		//先交换
            	swap(nums,p,q);
            	//再排序
            	reverse(nums,p+1,nums.length-1);
        		return;
        	}
        }
        //没找到，从最小排序
        reverse(nums,0,nums.length-1);
        
    }
	
	private static  void swap(int[] nums, int i, int j) {
	    int t = nums[i];
	    nums[i] = nums[j];
	    nums[j] = t;
	}
	
	private static void reverse(int[] nums, int i, int j) {
	    while (i < j) {
	        swap(nums, i, j);
	        i++;
	        j--;
	    }
	}

Runtime: 1 ms, faster than 87.63% of Java online submissions for Next Permutation.

Memory Usage: 41.4 MB, less than 33.00% of Java online submissions forNext Permutation.