LeetCode 47. Permutations II
2016-11-14 16:49
381 查看
描述
找出所有独一无二的排列解决
利用next_permutaion和uniqueclass Solution {
public:
vector<vector<int>> permuteUnique(vector<int>& nums) {
sort(nums.begin(), nums.end());
vector<vector<int>> res;
do
{
res.push_back(nums);
}while (next_permutation(nums.begin(), nums.end()));
return vector<vector<int>>(res.begin(), unique(res.begin(), res.end()));
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Leetcode 47. Permutations II
- 【LeetCode】47. Permutations II
- LeetCode-47-Permutations II 递归+dict
- LeetCode 47. Permutations II
- LeetCode 46 Permutations + LeetCode 47 Permutations II
- 【leetcode】【47】Permutations II
- leetcode-47-Permutations II 搜索-剪枝
- LeetCode47:Permutations II
- LeetCode 47. Permutations II
- LeetCode 47 Permutations II（全排列）
- [leetCode刷题笔记]47. Permutations II
- LeetCode--47. Permutations II
- Leetcode-47. Permutations II
- Leetcode 47. Permutations II
- leetcode || 47、 Permutations II
- LeetCode-----46.Permutations&&47.Permutations II （全排列----回溯法）
- LeetCode（47）Permutations II
- Leetcode 46. Permutations & 47. Permutations II
- leetcode[47]Permutations II
- [Leetcode 47, Hard] Permutations II