leetcode 39: Combination Sum
来源:互联网 发布:php 非阻塞io 编辑:程序博客网 时间:2024/05/24 03:04
class Solution {public: vector<vector<int>> combinationSum(vector<int>& candidates, int target) { vector<vector<int> > res; vector<int> set; sort(candidates.begin(),candidates.end()); helper(candidates,0,target,set,res); return res; } void helper(vector<int>& candidates,int idx,int target,vector<int>& set,vector<vector<int> >& res){ for(int i=idx;i<candidates.size()&&candidates[i]<=target;i++) { set.push_back(candidates[i]); if(candidates[i]==target) { res.push_back(set); set.pop_back(); break; } else { helper(candidates,i,target-candidates[i],set,res); set.pop_back(); } } }};
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
- 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
- leetcode 39 Combination Sum
- 异步消息处理机制-Handler、AsyncTask
- 黑马程序员-C语言学习笔记(循环)
- Git/Github的使用并与Eclipse整合
- _ _type_traits
- 学习easyui疑问(二)
- leetcode 39: Combination Sum
- HBase 常用Shell命令
- poj 1532 【求无向图的所有割点 以及 该点分成的BCC数目】
- Android控件的一些属性
- linux0.12之内核代码signal.c说明
- Win7局域网打印机共享设置(详细图文流程)
- JSP四个作用域
- TOJ 4117 Happy tree friends
- 图说 web应用的基本结构和web.xml