leetcode 40. 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:

- All numbers (including target) will be positive integers.

- 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]

]

思路：在leetcode39的基础上进行修改：首先是递归到下一层时level取为i+1；在递归返回后取下一个值时要取到跟前边不相等的值，避免相同结果的出现

leetcode40.java

import java.util.*;
class Solution {
	List<List<Integer>> ans;
	List<Integer> currentNums;
    public List<List<Integer>> combinationSum(int[] candidates, int target) {
        ans=new ArrayList<>();
		currentNums=new ArrayList<>();
		Arrays.sort(candidates);
		fun(candidates,target,0,0);
		
		return ans;
    }
	public void fun(int[] candidates,int target,int sum,int level)
	{
		int k;
		if(sum>target)
			return;
		if(sum==target)
		{
			ans.add(new ArrayList<>(currentNums));
			return;
		}
		for(int i=level;i<candidates.length;i+=k)
		{
			k=0;
			sum+=candidates[i];
			currentNums.add(candidates[i]);
			fun(candidates,target,sum,i+1);
			sum-=candidates[i];
			currentNums.remove(currentNums.size()-1);
			
			while(i+k<candidates.length && candidates[i+k]==candidates[i])
				k++;
			
		}
	}
}
public class leetcode40
{
	public static void main(String args[])
	{
		Solution mySolution=new Solution();
		List<List<Integer>> ans;
		int target=8;
		int[] candidates={10, 1, 2, 7, 6, 1, 5};
		ans=mySolution.combinationSum(candidates,target);
		for(List<Integer> singleAns:ans)
		{
			for(Integer num:singleAns)
			{
				System.out.printf(num+" ");
			}
			System.out.println("");
		}
	}
}