[LeetCode40]Combinations 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:

• All numbers (including target) will be positive integers.
• Elements in a combination (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
• 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]

Analysis:

The idea is similar with the former one, the difference is to get avoid of duplicate numbers.

Java

public class Solution {
    List<List<Integer>> result;
	List<Integer> solu;
	public List<List<Integer>> combinationSum2(int[] num, int target) {
		result = new ArrayList<>();
        solu = new ArrayList<>();
        Arrays.sort(num);
        getComboSum(num, target, 0, 0);
        return result;
    }
	public void getComboSum(int []num, int target, int sum, int level){
		if(sum==target){
			result.add(new ArrayList<>(solu));
			return;
		}
		if(sum>target) return;
		for(int i=level;i<num.length;i++){
			sum+=num[i];
			solu.add(num[i]);
			getComboSum(num, target, sum, i+1);
			sum-=num[i];
			solu.remove(solu.size()-1);
			while(i<num.length-1 && num[i]==num[i+1]) i++;
		}
	}
}

update: no global variable

public List<List<Integer>> combinationSum2(int[] candidates, int target) {
        List<List<Integer>> res = new ArrayList<>();
        List<Integer> temp = new ArrayList<>();
        Arrays.sort(candidates);
        findSum(candidates, target, 0,0,temp, res);   
        return res;
    }
    public void findSum(int[] candidates, int target, int sum, int level,List<Integer> temp, List<List<Integer>> res){
        if(sum == target) {
            res.add(new ArrayList<>(temp));
            return;
        } else if(sum > target) {
            return;
        } else {
            for(int i=level;i<candidates.length;i++) {
                temp.add(candidates[i]);
                findSum(candidates, target, sum+candidates[i], i+1, temp, res);
                temp.remove(temp.size()-1);
                while(i<candidates.length-1 && candidates[i]==candidates[i+1]) i++;
            }
        }
    }

c++

class Solution {
public:
    void getCombineSum2(
                   int &sum,
                   int level,
                   int target,
                   vector<int> &solution,
                   vector<int> &num,
                   vector<vector<int>> &result
                   ){
    if(sum > target) return;
    if(sum == target) {
        result.push_back(solution);
        return;
    }
    for(int i=level; i<num.size(); i++){
        sum += num[i];
        solution.push_back(num[i]);
        getCombineSum2(sum,i+1,target,solution,num,result);
        sum -= num[i];
        solution.pop_back();
        while(i<num.size()-1 && num[i]== num[i+1]) i++;
    }
}
vector<vector<int> > combinationSum2(vector<int> &num, int target) {
    vector<int> solution;
    vector<vector<int>> result;
    int sum = 0;
    sort(num.begin(), num.end());
    getCombineSum2(sum,0,target,solution,num,result);
    return result;
}
};