leetcode 39. Combination Sum
来源:互联网 发布:qq业务乐园源码 编辑:程序博客网 时间:2024/06/06 15:35
class Solution {
public:
vector<vector<int>> res;
void findPath(vector<int>& path,vector<int> candidates,int target)
{
if(target<0)
return;
if(target==0){
res.push_back(path);
}
for(auto n:candidates)
{
int size=(int)path.size();
if(size>0&&n<path[size-1])
continue;
path.push_back(n);
findPath(path, candidates, target-n);
path.pop_back();
}
}
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
vector<int> path;
findPath(path, candidates, target);
returnres;
}
};
阅读全文
0 0
- [LeetCode]39.Combination Sum
- LeetCode --- 39. Combination Sum
- LeetCode 39.Combination Sum
- [Leetcode] 39. Combination Sum
- Leetcode-39.Combination Sum
- LeetCode 39. Combination Sum
- [LeetCode]39. Combination Sum
- 39. Combination Sum LeetCode
- [leetcode] 39. Combination Sum
- leetcode 39. Combination Sum
- 【leetcode】 39. Combination Sum
- LeetCode 39. Combination Sum
- leetcode 39. Combination Sum
- LeetCode 39. Combination Sum
- LeetCode *** 39. Combination Sum
- LeetCode 39. Combination Sum
- leetcode 39. Combination Sum
- LeetCode - 39. Combination Sum
- TaotaoResult
- C语言操作符简介
- html规范和兼容测试
- Android点击空白区域,隐藏输入法软键盘
- JS的跨域问题
- leetcode 39. Combination Sum
- Java版本 排序算法总结
- MFC一些语法笔记
- apache.commons.lang3.StringUtils工具类的使用
- IntelliJ IDEA常用快捷键
- MySQL 错误码: 1093 You can't specify target table 'jc_user' for update in FROM clause
- Android消息机制,从Java层到Native层剖析
- 初学http整理笔记 post方法请求,将路径拼接方法
- Java SE——运算符