@@ -0,0 +1,1135 @@
+/**%0A * Problem: https://leetcode.com/problems/combination-sum-ii/%0A */%0A%0Apublic class Solution %7B%0A    %0A    public List%3CList%3CInteger%3E%3E combinationSum2(int%5B%5D candidates, int target) %7B%0A        Set%3CList%3CInteger%3E%3E result = new HashSet%3CList%3CInteger%3E%3E();%0A        if(candidates.length == 0) return new ArrayList%3CList%3CInteger%3E%3E();%0A        List%3CInteger%3E current = new ArrayList%3CInteger%3E();%0A        Arrays.sort(candidates);%0A        combinationSum(candidates, target, 0, current, result);%0A        return new ArrayList%3CList%3CInteger%3E%3E(result);%0A    %7D%0A    %0A    public void combinationSum(int%5B%5D candidates, int target, int start, List%3CInteger%3E curr, Set%3CList%3CInteger%3E%3E result)%7B%0A        if(target == 0) %7B%0A            List%3CInteger%3E tmp = new ArrayList%3CInteger%3E(curr);%0A            result.add(tmp);%0A            return;%0A        %7D%0A        if(start %3E= candidates.length) return;%0A        for(int i=start; i%3Ccandidates.length; i++) %7B%0A            if(target %3C candidates%5Bstart%5D) return;%0A            curr.add(candidates%5Bi%5D);%0A            combinationSum(candidates, target - candidates%5Bi%5D, i+1, curr, result);%0A            curr.remove(curr.size()-1); %0A        %7D%0A    %7D%0A%7D%0A

Create Combination_Sum_II.java