LeetCode 刷题笔记 之 Combination Sum

题目如下：

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

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

Note:

• All numbers (including target) will be positive integers.
• The solution set must not contain duplicate combinations.

Example 1:

Input: candidates = [2,3,6,7], target = 7,
A solution set is:
[
  [7],
  [2,2,3]
]

Example 2:

Input: candidates = [2,3,5], target = 8,
A solution set is:
[
  [2,2,2,2],
  [2,3,3],
  [3,5]
]

解答如下：

基本上还是用递归来做。

class Solution {
    public List<List<Integer>> combinationSum(int[] candidates, int target) {
        List<List<Integer>> res = new ArrayList<List<Integer>>();  
        if (candidates == null || candidates.length < 1)  
            return res;  
        Arrays.sort(candidates);  
  
        backtrack(candidates, target, res, new ArrayList<Integer>(), 0);  
  
        return res;  
        
    }
    public void backtrack(int[] nums, int target, List<List<Integer>> res, ArrayList<Integer> list, int start) {  
        if (target < 0)  
            return;  
        if (target == 0) {  
            res.add(list);  
            return;  
        }   
        for (int i = start; i < nums.length && target >= nums[i]; i++) {  
            list.add(nums[i]);  
            backtrack(nums, target - nums[i], res, new ArrayList<Integer>(list), i);  
            list.remove(list.size() - 1);  
        }  
    }  
}