[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

思路：

1. 从后向前遍历，找到第一个（也就是最后一个）acsending pair。比如：{1, 3, 2}。另这个pair的前一个的index是i。如果没有这样的pair，那就是最后一个permutation, 直接反转整个input就行了。

2. 从这个pair之后的所有元素中，找到最后一个比input[i]大的（也是从后向前找）。swap这个元素和input[i]。

3. swap之后，i+1之后的所有元素，包括i+1，仍然是降序的。反转之。

代码 （O(n)）：

class Solution {
public:
	void reverse(vector<int> &num, int start) {
		if (start >= num.size() - 1)
			return;
		int i = start;
		int j = num.size() - 1;
		while (i <= j) {
			int temp = num[i];
			num[i] = num[j];
			num[j] = temp;
			i ++;
			j --;
		}
	}

	void nextPermutation(vector<int> &num) {
		int index = -1;
		for (int i = num.size() - 1; i > 0; i --) {
			if (num[i - 1] < num[i]) {
				index = i - 1;
				break;
			}
		}
		if (index == -1)
			reverse (num, 0);
		else {
			for (int i = num.size() - 1; i > index; i --) {
				if (num[i] > num[index]) {
					int temp = num[i];
					num[i] = num[index];
					num[index] = temp;
					reverse(num, index + 1);
					return;
				}
			}
		}
	}
};