题目:https://oj.leetcode.com/problems/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.
Note:
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]
public class Solution { public List<List<Integer>> combinationSum2(int[] candidates, int target) { if (candidates == null) { return null; } Set<List<Integer>> results = new HashSet<List<Integer>>(); Stack<Integer> stack = new Stack<Integer>(); Arrays.sort(candidates); DFS(candidates,0, target, stack, results); return new ArrayList<List<Integer>>(results); } @SuppressWarnings("unchecked") private void DFS(int[] candidates,int start, int target, Stack<Integer> stack, Set<List<Integer>> results) { if (target == 0) { results.add((Stack<Integer>) (stack.clone())); } for (int i = start; i < candidates.length; i++) { stack.push(candidates[i]); if (target - candidates[i] >= 0) { DFS(candidates, i+1,target - candidates[i], stack, results); } stack.pop(); } } }