LeetCode-Combination Sum

Description:
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]
]

题意：给定一个一维数组（里面不包含重复的数字），要求从数组中找出几个数字（可重复使用一个数字）使其和为target；返回所有可能的组合；

解法：这道题目可以使用回溯法来解决，要注意的是可以重复使用同一个数字，我们对每个元素进行累加包括同一个元素的重复累加，最后判断其和是否满足给定的target，当其和大于target时，我们进行回溯；

class Solution {
    public List<List<Integer>> combinationSum(int[] candidates, int target) {
        LinkedList<List<Integer>> result = new LinkedList<List<Integer>>();
        LinkedList<Integer> list = new LinkedList<>();
        Arrays.sort(candidates);
        combination(result, list, candidates, target, 0, 0);
        return result;
    }

    private void combination(LinkedList<List<Integer>> result,LinkedList<Integer>list, 
                             int[] candidates, int target, int sum, int index) {
        if (sum == target) {
            result.addLast(new LinkedList(list));
            return;
        } else if (sum > target) {
            return;
        }
        for(int i=index; i<candidates.length; i++) {
            sum += candidates[i];
            list.addLast(candidates[i]);
            combination(result, list, candidates, target, sum, i);
            sum -= candidates[i];
            list.removeLast();
        }
    }
}