算法系列——组合总数II(Combination Sum II)

题目描述

题目链接:https://leetcode-cn.com/problems/combination-sum-ii/
Given a collection of candidate numbers © 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.

解题思路

和Combination Sum 类似，只不过需要跳过重复元素不予处理。

程序实现

public class Solution {
    private List<List<Integer>> result=new ArrayList<List<Integer>>();
    public List<List<Integer>> combinationSum2(int[] candidates, int target) {
        if(candidates==null||candidates.length==0||target<0)
            return result;
        Stack<Integer> c=new Stack<Integer>();
        Arrays.sort(candidates);
        backTracking(candidates,target,0,c);
        return result;
    }
    private void  backTracking(int[] candidates,int target,int start,Stack<Integer> c){
        if(target<0)
            return;
        if(target==0){
            result.add(new ArrayList<Integer>(c));
            // return;
        }
        else{
            for(int i=start;i<candidates.length;i++){
                target-=candidates[i];
                c.push(candidates[i]);
                backTracking(candidates,target,i+1,c);
                c.pop();
                target+=candidates[i];
                while((i<candidates.length-1)&&(candidates[i]==candidates[i+1]))
                    i++;
            }
        }
            
    }