LeetCode Combination Sum
来源:互联网 发布:js只让页面刷新一次 编辑:程序博客网 时间:2024/05/22 12:19
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: void dfs(vector<int> candidates, int index, int sum, int target, vector<vector<int>> &res, vector<int> &path) { if (sum > target) return; if (sum == target) { res.push_back(path); return; } for (int i = index; i < candidates.size(); i++) { path.push_back(candidates[i]); dfs(candidates, i, sum+candidates[i], target, res, path); path.pop_back(); } } vector<vector<int> > combinationSum(vector<int> &candidates, int target) { sort(candidates.begin(), candidates.end()); vector<vector<int> > res; vector<int> path; dfs(candidates, 0, 0, target, res, path); return res; }};
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
- 浅谈Flash调试和RAM调试的区别
- 环形缓冲区读取磁盘
- wifi ap状态
- Android开发:shape和selector和layer-list的(详细说明)
- 写文本函数
- LeetCode Combination Sum
- 选择排序法
- Oracle 10.2.0.5 + OFS 3.4.2 双节点集群
- POJ 2002 Squares(枚举+几何)
- 杨辉三角
- 《C语言函数大全》 摘录
- php实现将文件写入数据库、从数据库读取文件(防止图片上传漏洞)
- POJ 3694 Network (求割边 + LCA)
- 什么是公有IP地址?什么是私有IP地址?及各自范围介绍