Combination Sum II 组合数之和(包含有重复的元素)
来源:互联网 发布:米5登不了淘宝手机助手 编辑:程序博客网 时间:2024/06/06 03:37
class Solution {
public:
void DFS(int start,int cursum,int target,vector<int> &candidates,vector<int> &path,vector<vector<int>>&ret)
{
if(cursum==target)
{
ret.push_back(path);
return;
}
int previous=-1;
for(int i=start;i<candidates.size();i++)
{
if(previous==candidates[i])
continue;
cursum+=candidates[i];
if(cursum>target)
return;
previous=candidates[i];
path.push_back(candidates[i]);
DFS(i+1,cursum,target,candidates,path,ret);
path.pop_back();
cursum-=candidates[i];
}
}
vector<vector<int> > combinationSum2(vector<int> &num, int target) {
sort(num.begin(),num.end());
vector<int> path;
vector<vector<int>> ret;
DFS(0,0,target,num,path,ret);
return ret;
}
};
public:
void DFS(int start,int cursum,int target,vector<int> &candidates,vector<int> &path,vector<vector<int>>&ret)
{
if(cursum==target)
{
ret.push_back(path);
return;
}
int previous=-1;
for(int i=start;i<candidates.size();i++)
{
if(previous==candidates[i])
continue;
cursum+=candidates[i];
if(cursum>target)
return;
previous=candidates[i];
path.push_back(candidates[i]);
DFS(i+1,cursum,target,candidates,path,ret);
path.pop_back();
cursum-=candidates[i];
}
}
vector<vector<int> > combinationSum2(vector<int> &num, int target) {
sort(num.begin(),num.end());
vector<int> path;
vector<vector<int>> ret;
DFS(0,0,target,num,path,ret);
return ret;
}
};
0 0
- Combination Sum II 组合数之和(包含有重复的元素)
- Combination Sum 组合数之和
- UVa10776 - Determine The Combination(有重复元素的组合问题)
- [Java代码] [Leetcode] Combination Sum 组合数之和
- [Java代码] [Leetcode] Combination Sum 组合数之和
- LeetCode | Combination Sum II(元素的和---2)
- Leetcode Subsets II 有重复元素的组合
- poj 3046 dp(有重复元素的组合数)
- bzoj 1630 && 2023: [Usaco2005 Nov]Ant Counting 数蚂蚁(有重复元素的组合数)
- 153.Combination Sum II-数字组合 II(中等题)
- Combination Sum IV 组合数
- LeetCode 40. Combination Sum II(组合求和)
- Combination Sum II:允许重复的数组中选取若干元素使和为某一给定值
- Combination Sum (II)
- Combination Sum II 无序数组中找组合(每个元素只能用一次)使得和为target@LeetCode@LeetCode
- [LeetCode] Combination Sum 和确定的组合数的个数
- LeetCode | Combination Sum(元素的和)
- 【LeetCode-面试算法经典-Java实现】【216-Combination Sum III (组合数的和)】
- WCF-006:服务端类的封装问题
- Combination Sum 组合数之和
- 题目1102:最小面积子矩阵
- 春运网络购票诈骗频发 消费者慎防钓鱼陷阱
- 深入浅出Swing事件分发线程
- Combination Sum II 组合数之和(包含有重复的元素)
- HDU 4009 最小树形图裸题
- Struts2文件上传大小控制与提示
- eclipse maven plugin 插件 安装 和 配置
- 斐波纳契(兔子问题)
- [Java] 动态代理 03 --(解决接口也当参数传)
- TNS-04610问题
- How to Read Buffer Cache Advisory Section in AWR and Statspack Reports. (文档 ID 754639.1)
- 获取当前系统时间