39. Combination Sum
来源:互联网 发布:用ps淘宝详情页怎么做 编辑:程序博客网 时间:2024/04/25 23:27
class Solution(object):
def combinationSum(self, candidates, target):
"""
:type candidates: List[int]
:type target: int
:rtype: List[List[int]]
"""
candidates.sort()
res=[]
line=[]#nums
self.helper(candidates,target,res,line)
return res
def helper(self,nums,target,res,line):
if target==0:
res.append([x for x in line])
return
for i,x in enumerate(nums):
if x<=target:
line.append(x)
self.helper(nums[i:],target-x,res,line)
def combinationSum(self, candidates, target):
"""
:type candidates: List[int]
:type target: int
:rtype: List[List[int]]
"""
candidates.sort()
res=[]
line=[]#nums
self.helper(candidates,target,res,line)
return res
def helper(self,nums,target,res,line):
if target==0:
res.append([x for x in line])
return
for i,x in enumerate(nums):
if x<=target:
line.append(x)
self.helper(nums[i:],target-x,res,line)
line.pop()#这里是删除无法满足条件的因子
比如【2,3,6,7】当到了target=3后line会添加2,但是target=1时,数组中不含1,所以要删除掉刚刚加的哪个2
阅读全文
0 0
- 39. Combination Sum && 40. Combination Sum II
- 39. Combination Sum &&40. Combination Sum II
- [LeetCode]39.Combination Sum
- LeetCode --- 39. Combination Sum
- LeetCode 39.Combination Sum
- [Leetcode] 39. Combination Sum
- 39. Combination Sum
- 39. Combination Sum
- Leetcode-39.Combination Sum
- LeetCode 39. Combination Sum
- [LeetCode]39. Combination Sum
- 39. Combination Sum LeetCode
- [leetcode] 39. Combination Sum
- 39. Combination Sum
- 39. Combination Sum
- leetcode 39. Combination Sum
- 【leetcode】 39. Combination Sum
- 39. Combination Sum(backtracking)
- MySQL监控利器-Innotop
- Git中三种文件状态及其转换
- 上传工具类
- Scala学习笔记系列<1>
- Instant Run使用要注意的坑
- 39. Combination Sum
- 使用IntelliJ IDEA开发SpringMVC网站(四)用户管理
- oracle 创建 dblink
- 最短路问题 Dijkstra标号法
- python调试pdb
- java设计模式--代理模式(三)
- easyui easyui-layout 调整布局大小
- KETTLE整库迁移方案(SQL server迁移至Mysql,迁移过程自动创建表结构)
- SVN 学习笔记