Leetcode 78. 子集
class Solution {
public:
vector<vector<int>> ans;
vector<int> path;
void dfs(vector<int>& nums, int start) {
// if (start == nums.size()) {
// ans.push_back(path);
// return ;
// }
ans.push_back(path);
for (int i = start; i < nums.size(); i++) {
path.push_back(nums[i]);
dfs(nums, i + 1);
path.pop_back();
}
}
vector<vector<int>> subsets(vector<int>& nums) {
dfs(nums, 0);
return ans;
}
};
Leetcode 90. 子集 II(剪枝)
class Solution {
public:
vector<vector<int>> ans;
vector<int> path;
void dfs(vector<int>& nums, int start) {
ans.push_back(path);
for (int i = start; i < nums.size(); i++) {
// 剪枝
if (i > start && nums[i] == nums[i - 1])
continue;
path.push_back(nums[i]);
dfs(nums, i + 1);
path.pop_back();
}
}
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
sort(nums.begin(), nums.end());
dfs(nums, 0);
return ans;
}
};
Leetcode 39. 组合总和
class Solution {
public:
vector<vector<int>> ans;
vector<int> path;
void dfs(vector<int>& nums, int target, int start) {
if (start == nums.size())
return ;
if (target == 0) {
ans.push_back(path);
return ;
}
for (int i = start; i < nums.size(); i++) {
if (target - nums[i] < 0) continue;
path.push_back(nums[i]);
dfs(nums, target - nums[i], i);
path.pop_back();
}
}
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
sort(candidates.begin(), candidates.end());
dfs(candidates, target, 0);
return ans;
}
};
Leetcode 40. 组合总和 II
class Solution {
public:
vector<int> path;
vector<vector<int>> ans;
void dfs(vector<int>& nums, int target, int start) {
if (target == 0) {
ans.push_back(path);
return ;
}
for (int i = start; i <= nums.size(); i++) {
if (i > start && nums[i] == nums[i - 1]) continue;
if (target - nums[i] >= 0) {
path.push_back(nums[i]);
dfs(nums, target - nums[i], i + 1);
path.pop_back();
}
}
}
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
sort(candidates.begin(), candidates.end());
dfs(candidates, target, 0);
return ans;
}
};