标签：style blog http color os 2014
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 class Solution { 2 public: 3 void nextPermutation(vector<int> &num) { 4 if (num.size() == 1) return; 5 6 int reversed, bigger; 7 for (reversed = num.size() - 2; reversed >= 0 && num[reversed] >= num[reversed + 1]; reversed--); 8 for (bigger = num.size() - 1; bigger > reversed && num[bigger] <= num[reversed]; bigger--); 9 10 if (reversed < bigger) { 11 swap(num[reversed], num[bigger]); 12 sort(num.begin() + reversed + 1, num.end()); 13 } 14 else { 15 reverse(num.begin(), num.end()); 16 } 17 return; 18 } 19 };
LeetCode OJ - Next Permutation,布布扣,bubuko.com
LeetCode OJ - Next Permutation
标签：style blog http color os 2014
原文地址：http://www.cnblogs.com/dongguangqing/p/3820273.html
