40. Combination Sum II

Posted

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了40. Combination Sum II相关的知识,希望对你有一定的参考价值。

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

Each number in C 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.

 

For example, given candidate set [10, 1, 2, 7, 6, 1, 5] and target 8
A solution set is: 

[
  [1, 7],
  [1, 2, 5],
  [2, 6],
  [1, 1, 6]
]


以上是关于40. Combination Sum II的主要内容,如果未能解决你的问题,请参考以下文章

40. Combination Sum II

LeetCode 40 Combination Sum II(数组中求和等于target的所有组合)

leetcode-Combination Sum II-40

40. Combination Sum II

40. Combination Sum II

40. Combination Sum II