[JS] Combination Sum II

🔒 문제 (LeetCode)

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.

Constraints:

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

 

🌊 입출력

Example 1:

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

Example 2:

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

 

---

 

🔑 해결

🌌 알고리즘 - Backtraking

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