【leetcode】40. Combination Sum II

网址

题目

同上一题，不同的是加和的数不能重复

解法

import java.util.Arrays;
class Solution {
    public List<List<Integer>> combinationSum2(int[] candidates, int target) {
        List<List<Integer>> list = new ArrayList<>();
        Arrays.sort(candidates);
        backtrack(list, new ArrayList<>(), candidates, target, 0);
        return list;
    }

    private void backtrack(List<List<Integer>> list, List<Integer> tempList, int [] nums, int remain, int start){
        if(remain < 0) return;
        else if(remain == 0) list.add(new ArrayList<>(tempList));
        else{ 
            for(int i = start; i < nums.length; i++){
                if(i > start && nums[i] == nums[i-1]) continue; //和上一题的区别
                tempList.add(nums[i]);
                backtrack(list, tempList, nums, remain - nums[i], i+1); //和上一题的区别
                tempList.remove(tempList.size() - 1);
            }
        }
    }
}
 ``