[leetcode] 39. Combination Sum 解题报告
来源:互联网 发布:怎么做好淘宝店铺 编辑:程序博客网 时间:2024/06/05 05:51
题目链接:https://leetcode.com/problems/combination-sum/
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]
思路:一个DFS, 对于每一个数字可以不拿, 或者拿无限次, 因此在做DFS的时候要么不拿当前的数, 要么枚举拿1,2,3等多个, 直到超过了和的大小.
代码如下:
class Solution {public: void DFS(vector<int>& candidates, int sum, int k, vector<int> vec) { if(sum ==0) ans.push_back(vec); if(k >= candidates.size() || sum <= 0) return; DFS(candidates, sum, k+1, vec); for(int i = 1; sum - i*candidates[k]>=0; i++) { vec.push_back(candidates[k]); DFS(candidates, sum-i*candidates[k], k+1, vec); } } vector<vector<int>> combinationSum(vector<int>& candidates, int target) { DFS(candidates, target, 0, vector<int>{}); return ans; }private: vector<vector<int>> ans;};
0 0
- [leetcode] 39. Combination Sum 解题报告
- [Leetcode] 39. Combination Sum 解题报告
- 【LeetCode】39.Combination Sum(Medium)解题报告
- leetcode Combination Sum解题报告
- LeetCode解题报告--Combination Sum
- Leetcode #39. Combination Sum 组合求和 解题报告
- 【LeetCode】Combination Sum I & II 解题报告
- LeetCode-Combination Sum III-解题报告
- LeetCode解题报告--Combination Sum II
- [leetcode] 40. Combination Sum II 解题报告
- [leetcode] 216. Combination Sum III 解题报告
- [leetcode] 377. Combination Sum IV 解题报告
- leetcode 377. Combination Sum IV 解题报告
- leetcode 40. Combination Sum II 解题报告
- LeetCode 216. Combination Sum III 解题报告
- [Leetcode] 40. Combination Sum II 解题报告
- [Leetcode] 216. Combination Sum III 解题报告
- [Leetcode] 377. Combination Sum IV 解题报告
- android 录音笔demo!!!(Baseadapter、file、MediaRecorder、AlertDialog)
- S3C2440 LCD液晶模块驱动设计
- 零基础自学Python两个月小结
- Codeforces 437A The Child and Homework
- 常见报错信息
- [leetcode] 39. Combination Sum 解题报告
- android studio 首字母提示 设置 大小写敏感
- Easy ui数据属性(当前页数,总页数,总记录数,当前记录数)
- 关于林锐内存思考
- docker实战1:系统准备
- 抽象类的应用--模板设计
- 自行搭建环境看法
- Sass和Compass学习笔记(1)
- 异常