Next Permutation -- leetcode
来源:互联网 发布:c语言ns流程图 编辑:程序博客网 时间:2024/06/06 13:58
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
class Solution {public: void nextPermutation(vector<int> &num) { if (num.size() <= 1) return; int i = int(num.size()) - 2; while (i>=0 && num[i]>=num[i+1]) i--; if (i >= 0) { int j = i + 1; while (j < num.size() && num[j] > num[i]) j++; swap(num[i], num[j-1]); } reverse(num.begin()+(i+1), num.end()); }};
下面图片很详细的介绍了算法:(图片来源)
0 0
- LeetCode: Next Permutation
- LeetCode Next Permutation
- LeetCode : Next Permutation
- [Leetcode] Next Permutation
- [LeetCode] Next Permutation
- [Leetcode] Next Permutation
- leetcode 88: Next Permutation
- [LeetCode]Next Permutation
- LeetCode-Next Permutation
- [leetcode]Next Permutation
- LeetCode - Next Permutation
- LeetCode 31: Next Permutation
- 【leetcode】Next Permutation
- LeetCode题解:Next Permutation
- 【LeetCode】Next Permutation
- [LeetCode] Next Permutation
- LeetCode Next Permutation
- leetCode | Next Permutation
- select
- Factorial Trailing Zeroes (Java)
- Jquery 1.6+ .prop()与.attr()方法比较
- VS2005调试技巧集合
- 申请免费代码签名证书
- Next Permutation -- leetcode
- android中init过程解析
- LeetCode Palindrome Partitioning II
- JS插件汇总
- iOS APP支持64位相关资料整理
- Duilib技巧:背景图片平铺
- android的网络请求服务端后解析jsone
- epol模型详解
- TestNG - xml include other suite xml file