LintCode: 数字组合 II

最新推荐文章于 2020-01-10 20:02:40 发布

zyaphone

最新推荐文章于 2020-01-10 20:02:40 发布

阅读量391

点赞数

分类专栏： lintcode python

本文链接：https://blog.csdn.net/u012225151/article/details/52282687

版权

lintcode 同时被 2 个专栏收录

139 篇文章 0 订阅

订阅专栏

python

116 篇文章 0 订阅

订阅专栏

LintCode: 数字组合 II

import copy
class Solution:    
    """
    @param candidates: Given the candidate numbers
    @param target: Given the target number
    @return: All the combinations that sum to target
    """
    def combinationSum2(self, candidates, target): 
        # write your code here
        self.ans = []
        res = []
        self.my_combinationSum2(candidates, target, res, 0)
        return self.ans

    def my_combinationSum2(self, candidates, target, res, index):
        if sum(res) == target and sorted(res) not in self.ans:
            self.ans.append(copy.copy(sorted(res)))
            return
        if sum(res) > target:
            return
        for index in range(index, len(candidates)):
            res.append(candidates[index])
            self.my_combinationSum2(candidates, target, res, index+1)
            res.pop()