Leetcode之Next Permutation(Permutation 专题)

专题：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, do not allocate 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

» Solve this problem

方法：

1. 找到最右边的最长降序字段，逆序之

2. 指针一指向该字段的左一节点，指针二指向指针一的右边一个节点（即降序字段逆序后的左一节点）

3. 如果指针一不指向数组头节点，指针二向右移动，直到遇到一个大于指针一的值的节点，两个指针交换

4. 如果指针一指向头结点，直接返回

代码：

public class Solution {
    public void nextPermutation(int[] num) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int current = num.length - 1;
        while(current>0 && num[current-1]>=num[current])
            current--;
        reverse(num, current, num.length-1);
        
        int next = current;
        current--;
        while(next < num.length){
            if(current>=0  && num[next]>num[current]){
                swap(num, next, current);
                break;
            }
            next++;
        }
    }
    private void swap(int[] num, int i, int j){
        int tmp = num[i];
        num[i] = num[j];
        num[j] = tmp;
    }
    private void reverse(int[] num, int i, int j){
        while(i < j)
            swap(num, i++, j--);
    }
}

小结：

Permutation专题中，此题结构最为简单，思想却较为复杂。