Combination Sum II

Description

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]
]

Solution(javascript)

// const combinationSum2 = (candidates = [], target) => {
//   const result = {}
//   candidates.sort()
//   const aux = (index, currentTarget, current) => {
//     if (currentTarget === target) {
//       result[current.toString()] = current
//     }
//     if (currentTarget <= target) {
//       for (let i = index; i < candidates.length; i++) {
//         aux(i + 1, currentTarget + candidates[i], [...current, candidates[i]])
//       }
//     }
//   }
//   aux(0, 0, [])
//   return Object.values(result)
// }

const combinationSum2 = (candidates = [], target) => {
  const result = []
  candidates.sort()
  const aux = (index, currentTarget, current) => {
    if (currentTarget === target) {
      result.push(current)
    }
    if (currentTarget <= target) {
      for (let i = index; i < candidates.length; i++) {
        if (i > index && candidates[i] === candidates[i - 1]) {
          continue
        }
        aux(i + 1, currentTarget + candidates[i], [...current, candidates[i]])
      }
    }
  }
  aux(0, 0, [])
  return result
}