算法w9——Combination Sum

题目：leetcode 39. Combination Sum

地址：https://leetcode.com/problems/combination-sum/#/description

原题：

Given a set of candidate numbers (C) (without duplicates) 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.
• 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 combinationSum(self, candidates, target):
        """
        :type candidates: List[int]
        :type target: int
        :rtype: List[List[int]]
        """
        ret_list = []
        candidates.sort()

        self.findans([], 0, target, candidates, ret_list)

        return ret_list

    def findans(self, ans, idx, target, candidates, ans_list):
        for i in range(idx, len(candidates)):
            if sum(ans) + candidates[i] > target:
                return
            elif sum(ans) + candidates[i] == target:
                ans_list.append(ans + [candidates[i]])
            else:
                self.findans(ans+[candidates[i]], i, target, candidates, ans_list)