Combination Sum II

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

Each number in candidates may only be used once in the combination.

Note:

• All numbers (including target) will be positive integers.

• The solution set must not contain duplicate combinations.

Example 1:

Input: candidates = [10,1,2,7,6,1,5], target = 8,

A solution set is:
[
  [1, 7],
  [1, 2, 5],
  [2, 6],
  [1, 1, 6]
]

Example 2:

Input: candidates = [2,5,2,1,2], target = 5,

A solution set is:
[
  [1,2,2],
  [5]
]

Thoughts:

1. Only two lines changes than 39. Combination Sum

Code

class Solution {
    public List<List<Integer>> combinationSum2(int[] nums, int target) {
    List<List<Integer>> list = new ArrayList<>();
    Arrays.sort(nums);
    backtrack(list, new ArrayList<>(), nums, 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++){
            // follow-up: Each number in candidates may only be used once in the combination + there are duplicates.
            if(i > start && nums[i] == nums[i - 1]) continue; // previous DFS has expanded later value!
            tempList.add(nums[i]);
            backtrack(list, tempList, nums, remain - nums[i], i + 1); // i + 1 HERE! because we CANNOT reuse same elements
            tempList.remove(tempList.size() - 1);
            }
        }
    }
}