Combination Sum II

Problem statement

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

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

Note: The solution set must not contain duplicate combinations.

Example 1:

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

Example 2:

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

Constraints:

• 1 <= candidates.length <= 100
• 1 <= candidates[i] <= 50
• 1 <= target <= 30

My solution

/**
 * @param {number[]} candidates
 * @param {number} target
 * @return {number[][]}
 */
var combinationSum2 = function(candidates, target) {
    const result = []
    candidates.sort((a, b) => a - b)
    
    // console.log(candidates)
    
    function dfs(idx, localTarget, arr = []) {
        // console.log(idx, localTarget, arr)
        if (localTarget < 0) {
            return;
        }
        
        if (localTarget === 0) {
            return result.push([...arr])
        }
        
        for (let i = idx; i < candidates.length; i++) {
            if (i !== idx && candidates[i] === candidates[i - 1]) {
                continue
            }
            // console.log(candidates[i])
            dfs(i + 1, localTarget - candidates[i], [...arr, candidates[i]])
        }
    }
    
    dfs(0, target)
    
    return result;
};