首页 > 代码库 > Subsets II
Subsets II
Given a collection of integers that might contain duplicates, S, return all possible subsets.
Note:
- Elements in a subset must be in non-descending order.
- The solution set must not contain duplicate subsets.
For example,
If S = [1,2,2], a solution is:
[ [2], [1], [1,2,2], [2,2], [1,2], []]
class Solution {public: vector<vector<int> > subsetsWithDup(vector<int> &S) { sort(S.begin(), S.end()); vector<vector<int>> ret = {{}}; int size = 0, startIndex = 0; for (int i = 0; i < S.size(); i++) { startIndex = i >= 1 && S[i] == S[i - 1] ? size : 0; size = ret.size(); for (int j = startIndex; j < size; j++) { vector<int> temp = ret[j]; temp.push_back(S[i]); ret.push_back(temp); } } return ret; }};
Subsets II
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。