39. Combination Sum leetcode python 2016 new season

最新推荐文章于 2016-01-25 13:14:07 发布

原创最新推荐文章于 2016-01-25 13:14:07 发布 · 586 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

leetcode 同时被 2 个专栏收录

166 篇文章

订阅专栏

2016刷题

45 篇文章

订阅专栏

本文介绍了一种寻找候选数集合中所有可能组合的算法，这些组合的和等于目标数。探讨了递归搜索方法，并提供了Python实现代码。强调了组合元素必须按非递减顺序排列且不含重复组合。

Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.

The same repeated number may be chosen from C unlimited number of times.

Note:

All numbers (including target) will be positive integers.
Elements in a combination (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
The solution set must not contain duplicate combinations.

For example, given candidate set 2,3,6,7 and target 7,
A solution set is:
[7]

[2, 2, 3]

class Solution(object):
    def bfs(self, candidates, target, start, valuelist, result):
        if target == 0:
            return result.append(valuelist)
        for index in range(start, len(candidates)):
            if target < candidates[index]:
                return
            self.bfs(candidates, target - candidates[index], index, valuelist + [candidates[index]], result)
    def combinationSum(self, candidates, target):
        """
        :type candidates: List[int]
        :type target: int
        :rtype: List[List[int]]
        """
        candidates.sort()
        result = []
        self.bfs(candidates, target, 0, [], result)
        return result