LeetCode | Permutations
2014-04-07 14:37
375 查看
Given a collection of numbers, return all possible permutations.
For example,
[1,2,3] have the following permutations:
[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].
For example,
[1,2,3] have the following permutations:
[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].
vector<vector<int> > permute(vector<int> &num) { vector<vector<int> > result; if (num.size() == 0) return result; std::sort(num.begin(), num.end()); do { result.push_back(num); } while (std::next_permutation(num.begin(), num.end())); return result; }
相关文章推荐
- LeetCode(Permutations) 数列的全排列
- [leetcode] Permutations
- LeetCode(46) Permutations
- Leetcode:Permutations 数组的全排列
- Leetcode Permutations
- leetcode Permutations
- LeetCode-Permutations
- LeetCode(46)Permutations
- 【LeetCode】Permutations 解题报告
- 一次搞懂全排列——LeetCode四道Permutations问题详解
- Leetcode: Permutations
- LeetCode——Permutations
- [leetcode]Permutations II @ Python
- LeetCode——Permutations
- LeetCode | Permutations(全排列)
- [Leetcode] Permutations
- [LeetCode]Permutations
- [leetcode]47. Permutations II@Java解题报告
- 【LeetCode】Permutations
- LeetCode – Refresh – Permutations