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 2 3 4 5
1 2 3 5 4
1 2 4 3 5
1 2 4 5 3
1 2 5 3 4
1 2 5 4 3
1 3 2 4 5
1 3 4 2 5
其中的规律仍然不明显,似乎有多种情况。从特殊到一般来归纳总结:
1.分析1 2 5 4 3, 当末尾3 4 5呈现出递增序列,5 2呈现出递减序列:2需要与递减序列中最小的数交换(大于2),得到1 3 5 4 2,接着原递增区间需要逆转得到1 3 2 5 4 。
2.分析1 3 2 4 5, 当末尾无递增序列,5 4呈现出递减序列:着原递减区间逆转得到 1 3 2 5 4。
3.验证其他项,看是否符合1、2情况 。
class Solution {
public:
void nextPermutation(vector<int> &num) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int i = num.size() - 2;
while (i >= 0 && num[i] >= num[i + 1]) {
i--;
}
if (i < 0) {
reverse(num.begin(), num.end() - 1);
}
else {
int j = i + 2;
while (j < num.size() && num[j] > num[i]) {
j++;
}
j--;
swap(num[i], num[j]);
reverse(num.begin() + i + 1, num.end() - 1);
}
}
private:
void reverse(vector<int>::iterator i1, vector<int>::iterator i2) {
while (i1 < i2) {
*i1 ^= *i2;
*i2 ^= *i1;
*i1 ^= *i2;
i1++;
i2--;
}
}
};
参考:http://blog.csdn.net/pickless/article/details/9188769