首页 > 代码库 > LeetCode Subsets II
LeetCode Subsets II
class Solution {public: vector<vector<int> > subsetsWithDup(vector<int> &S) { int len = S.size(); vector<vector<int> > res; vector<int> subset; if (len < 1) { res.push_back(subset); return res; } sort(S.begin(), S.end()); vector<int> stat; vector<int> nums; int count = 1; int cur = S[0]; int last = cur; for (int i=1; i<len; i++) { cur = S[i]; if (cur != last) { stat.push_back(count); nums.push_back(last); last = cur; count = 0; } count++; } stat.push_back(count); nums.push_back(last); dfs(nums, stat, res, subset, 0); } void dfs(vector<int> &nums, vector<int> &stat, vector<vector<int> > &res, vector<int> &subset, int k) { if (k >= nums.size()) { res.push_back(subset); return; } int cnt = stat[k]; int old = subset.size(); for (int i=0; i <= cnt; i++) { dfs(nums, stat, res, subset, k + 1); subset.push_back(nums[k]); } subset.resize(old); }};
常规dfs
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。