【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

解题思路：

比如4673821

从后往前找第一个递减的数，记为X 这里是X=3

如果X存在 从X往后找到第一个比X小的数，这里是2，然后记录Y=这个数的前一个数 所以Y=8

交换X和Y 变为4678321

然后从Y的后面那个数开始全部逆序

4678123 就是结果了

代码参考Code_Ganker

	public void nextPermutation(int[] num) {
		if (num == null || num.length == 0)
			return;
		int i = num.length - 2;
		while (i >= 0 && num[i] >= num[i + 1])
			i--;
		if (i >= 0) {
			int j = i + 1;
			while (j < num.length && num[j] > num[i])
				j++;
			exchange(num, i, --j);

		}
		reverse(num, i + 1);
	}

	public void reverse(int[] num, int index) {
		int left = index;
		int right = num.length - 1;
		while (left < right)
			exchange(num, left++, right--);
	}

	public void exchange(int[] num, int i, int j) {
		int temp = num[i];
		num[i] = num[j];
		num[j] = temp;
	}