leetcode_question_31 Next Permutation
2013-09-18 12:08
239 查看
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
void nextPermutation(vector<int> &num) {// Start typing your C/C++ solution below// DO NOT write int main() functionvector<int>::iterator it = num.begin();int length = num.size();int begin = 0;if(length < 2) begin = length-1;int i = length-1;for(; i > 0; i--)if(num[i] > num[i-1]) break;begin = i;if(begin > 0){int tmp = num[begin-1];int j = length-1;for(; j >= begin; j--)if(num[j] > tmp)break;num[begin-1] = num[j];num[j] = tmp;}int end = length-1;while(begin < end){int tmp = num[begin];num[begin] = num[end];num[end] = tmp;begin ++;end --;}}
相关文章推荐
- leetcode question 31:Next Permutation
- [leetcode]31.Next Permutation(Java实现)
- Leetcode 31. Next Permutation
- leetcode 31. Next Permutation
- leetCode(31):Combination Sum III
- Leetcode||31.Next Permutation
- [Leetcode 67] 31 Next Permutation
- leetcode_31题——Next Permutation(STL)
- QUESTION 31 CREATE table 注意事项
- leetcode 31. Next Permutation
- LeetCode -- Product of Array Except Self My Submissions Question
- (leetcode) 238. Product of Array Except Self My Submissions QuestionEditorial Solution
- LeetCode 31 - Next Permutation
- LeetCode 31. Next Permutation
- leetcode_question_62 Unique Paths
- leetcode_question_62 Unique Paths
- leetcode_question_85 Maximal Rectangle
- leetcode_question_114 Flatten Binary Tree to Linked List
- [LeetCode]31. Next Permutation
- 【LeetCode】31. Next Permutations 下一个全排列