[LeetCode] 39. Combination Sum

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