LeetCode力扣之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, 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

/**
 * Created by lxw, liwei4939@126.com on 2018/3/6.
 */
public class NextPermutation {

    public void nextPermutataion(int[] num){
        int len = num.length;
        if (len < 2){
            return;
        }

        int index = len - 1;
        while (index > 0){
            if (num[index] > num[index - 1]){
                break;
            }
            index -- ;
        }

        if (index == 0){
            reverseSort(num, 0, len - 1);
            return;
        } else {
            int val = num[index - 1];
            int j = len - 1;
            while (j >= index){
                if (num[j] > val){
                    break;
                }
                j--;
            }
            swap(num, j, index - 1);
            reverseSort(num, index, len - 1);
            return;
        }
    }

    public void swap(int[] num, int i, int j){
        int tmp = num[i];
        num[i] = num[j];
        num[j] = tmp;
    }

    public void reverseSort(int[] num, int start, int end){
        if (start > end){
            return;
        }
        for (int i = start; i <= (start + end) / 2; i++){
            swap(num, i, start + end - i);
        }
    }

    public static void main(String[] args){
        NextPermutation tmp = new NextPermutation();
        int[] arr = new int[]{1, 2, 3};
        tmp.nextPermutataion(arr);
        for (int each : arr){
            System.out.print(each + ", ");
        }
    }


}