LeetCode 90. Subsets II
solution1和2均是利用set的,3和4是不利用set的
Solution1:我的答案
迭代法
class Solution {
public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
sort(nums.begin(), nums.end());
vector<vector<int> > result;
vector<int> temp;
result.push_back(temp);
if (!nums.size()) return result;
for (int i = 0; i < nums.size(); i++) {
int temp_size = result.size();
for (int j = 0; j < temp_size; j++) {
vector<int> temp = result[j];
temp.push_back(nums[i]);
result.push_back(temp);
}
}
set<vector<int> > res(result.begin(), result.end());
return vector<vector<int> > (res.begin(), res.end());
}
};
Solution2:我的答案
递归法
class Solution {
public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
sort(nums.begin(), nums.end());
vector<vector<int> > result;
vector<int> temp;
my_subsets(nums, 0, result, temp);
set<vector<int> > res(result.begin(), result.end());
return vector<vector<int> > (res.begin(), res.end());
}
void my_subsets(vector<int>& nums, int step,
vector<vector<int> >& result,
vector<int>& temp) {
if (step == nums.size()) {
result.push_back(temp);
return;
}
//不选择nums[step]
my_subsets(nums, step + 1, result, temp);
//选择nums[step]
temp.push_back(nums[step]);
my_subsets(nums, step + 1, result, temp);
temp.pop_back();
}
};
Solution3:
参考网址:http://www.cnblogs.com/grandyang/p/4310964.html
我们先来看非递归解法,拿题目中的例子[1 2 2]来分析,根据之前 Subsets 子集合 里的分析可知,当处理到第一个2时,此时的子集合为[], [1], [2], [1, 2],而这时再处理第二个2时,如果在[]和[1]后直接加2会产生重复,所以只能在上一个循环生成的后两个子集合后面加2,发现了这一点,题目就可以做了,我们用last来记录上一个处理的数字,然后判定当前的数字和上面的是否相同:
1)若不同,则循环还是从0到当前子集的个数;
2)若相同,则当前子集个数newSize减去之前循环时子集的个数size,即newSize - size当做起点来循环,这样需要遍历的元素就是当前子集的最后size个元素。
这样就不会产生重复了,代码如下:
class Solution {
public:
vector<vector<int> > subsetsWithDup(vector<int> &S) {
if (S.empty()) return {};
vector<vector<int>> res(1);
sort(S.begin(), S.end());
int size = 1, last = S[0];
for (int i = 0; i < S.size(); ++i) {
if (last != S[i]) {
last = S[i];
size = res.size();
}
int newSize = res.size();
for (int j = newSize - size; j < newSize; ++j) {
res.push_back(res[j]);
res.back().push_back(S[i]);
}
}
return res;
}
};
Solution4:
参考网址:http://www.cnblogs.com/grandyang/p/4310964.html
递归法
代码只需在原有的基础上增加一句话,while (S[i] == S[i + 1]) ++i; 这句话的作用是跳过树中为X的叶节点,因为它们是重复的子集,应被抛弃。代码如下:
class Solution {
public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
vector<int> path;
vector<vector<int> > result;
result.push_back(path);
sort(nums.begin(), nums.end());
helper(nums, 0, path, result);
return result;
}
void helper (vector<int> &nums, int pos, vector<int>& path, vector<vector<int> > &result) {
if (pos == nums.size())
return ;
for (int i = pos; i < nums.size(); i++) {
path.push_back(nums[i]);
result.push_back(path);
helper(nums, i + 1, path, result);
path.pop_back();
while(i + 1 < nums.size() && nums[i] == nums[i+1]) i++;
}
}
};