Combination Sum leetcode
来源:互联网 发布:广州java架构师培训 编辑:程序博客网 时间:2024/05/17 07:24
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
The same repeated number may be chosen from C unlimited number of times.
Note:
- All numbers (including target) will be positive integers.
- Elements in a combination (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
- The solution set must not contain duplicate combinations.
For example, given candidate set 2,3,6,7
and target 7
,
A solution set is: [7]
[2, 2, 3]
class Solution {public: vector<vector<int> > combinationSum(vector<int> &candidates, int target) { vector<vector<int> > res; if(candidates.size() == 0) { return res; } sort(candidates.begin(),candidates.end()); vector<int> tmp; findSum(res,candidates,tmp,0,target); return res; } void findSum(vector<vector<int> >& res,vector<int>& candidates,vector<int>& tmp,int start,int target) { if(target<0) { return; }else if(target == 0) { res.push_back(tmp); return; } else { for(int i=start;i<candidates.size();i++) { if(i>start && candidates[i] == candidates[i-1]) { continue; } tmp.push_back(candidates[i]); findSum(res,candidates,tmp,i,target-candidates[i]); tmp.pop_back(); } } }};
0 0
- [LeetCode] Combination Sum、Combination Sum II
- 【LeetCode】Combination Sum && Combination Sum II
- leetcode之Combination Sum && Combination Sum II
- leetcode Combination Sum &Combination Sum II
- leetcode-combination sum and combination sum II
- Leetcode:Combination Sum与Combination Sum II
- leetcode Combination Sum VS Combination Sum II
- [Leetcode]Combination Sum &&Combination Sum II
- LeetCode Combination Sum & Combination Sum II
- leetcode | Combination Sum & Combination Sum 2
- LeetCode: Combination Sum
- LeetCode: Combination Sum II
- LeetCode: Combination Sum
- LeetCode: Combination Sum II
- [LeetCode]Combination Sum
- [LeetCode]Combination Sum II
- LeetCode Combination Sum
- LeetCode Combination Sum II
- Dubbo服务框架解析(二)
- js验证
- HDU 4975 A simple Gaussian elimination problem.(网络最大流)
- uboot启动阶段修改启动参数方法及分析
- 自行关闭指定Activity的方法
- Combination Sum leetcode
- 充值界面线程之 黑边 问题(Java调用C++时引起的线程问题)
- visual studio 2013 与 mysql 连接设置
- Codeforces Round #262 (Div. 2) A. Vasya and Socks
- wf
- 前设计师解读苹果四大神话
- java
- 如何阅读别人的代码
- linux内核分段和分页的原因