首页 > 代码库 > leetcode - Permutations II
leetcode - Permutations II
Given a collection of numbers that might contain duplicates, return all possible unique permutations.
For example,[1,1,2]
have the following unique permutations:[1,1,2]
, [1,2,1]
, and [2,1,1]
.
class Solution { public: std::vector<std::vector<int> > permuteUnique(std::vector<int> &num) { std::set<std::vector<int>> s; std::vector<std::vector<int>> res; std::sort(num.begin(),num.end()); do { s.insert(num); } while (std::next_permutation(num.begin(),num.end())); for(std::set<std::vector<int>>::iterator it = s.begin(); it != s.end(); it++) { res.push_back(*it); } return res; } };
leetcode - Permutations II
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。