Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
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]
]
这一题是39. Combination Sum的变种。区别在于，元素不能重复使用。所以在划分的时候，对candidates的处理也不同。
又提交了一次，一不小心就迎来了人生的第一个100%，主要的功劳在leetcode服务器。
