# [Lintcode] 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 to T.

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

Example

Given candidate set [10,1,6,7,2,1,5] and target 8,

A solution set is:

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

public class Solution {
/**
* @param num: Given the candidate numbers
* @param target: Given the target number
* @return: All the combinations that sum to target
*/
public List<List<Integer>> combinationSum2(int[] num, int target) {
List<List<Integer>> res = new ArrayList<List<Integer>>();
Arrays.sort(num);

helper(res, new ArrayList<Integer>(), num, target, 0);
return res;
}

void helper(List<List<Integer>> res, List<Integer> list, int[] num, int target, int index) {
if(target == 0) {
return;
}

if(index >= num.length || target < 0) return;

for(int i = index; i < num.length; i++) {
helper(res, list, num, target - num[i], i + 1);//i + 1 instead of index + 1
while(i + 1 < num.length && num[i] == num[i + 1]) i += 1;//在helper之后去重
//如果在helper之前去重的话，会漏掉结果集中存在重复元素的情况
// 1 1 2 5 6 7 10 -> 1 1 2 OK 在helper前去重漏掉的情况
// 1 1 2 5 6 7 10 -> 1 2 5, 1 2 5 KO 需要去重的情况
list.remove(list.size() - 1);
}
}
}



• 本文已收录于以下专栏：

## LeetCode_40---Combination Sum II

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations ...

## Leetcode #40. Combination Sum II 组合求和2 解题报告

1 解题思想这道题是昨天的升级版，先看看这个 Leetcode #39. Combination Sum 组合求和 解题报告这道题的改变就是每个位置的数只能用一次了，但是如果本身就给了多个的话就无...

## Combination Sum II

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

## LeetCode OJ算法题（三十九）：Combination Sum II

• op_yu
• 2014-07-25 12:26
• 240

## [leetcode] 040. Combination Sum II (Medium) (C++)

[leetcode] 040. Combination Sum II (Medium) (C++)
• hcbbt
• 2015-08-08 08:33
• 1341

## [LeetCode-Java]40. Combination Sum II

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

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)