每日一题-组合总和

Angel__c

于 2020-02-11 17:13:50 发布

阅读量150

点赞数

本文链接：https://blog.csdn.net/Angel__c/article/details/104266229

版权

采用回溯算法:

$S(list,target)=\sum_{i} S(list[i:], target - list[i])$

代码：

class Solution:
    def fuc(self, candidates: List[int], target: int) -> List[List[int]]:
        if target < candidates[0]:
            return []
        res = []
        for i,c in enumerate(candidates):
            if c == target:
                res.append([c])
                return res
            next_res = self.fuc(candidates[i:], target - c)
            for elm in next_res:
                elm.insert(0,c)
                res.append(elm)
        return res

    def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]:
        candidates.sort()
        res = self.fuc(candidates, target)
        return res