Leetcode之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.
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 set10,1,2,7,6,1,5and target8,
A solution set is:
[1, 7]
[1, 2, 5]
[2, 6]
[1, 1, 6]

解题思路：先排序，然后dfs。因为不能重复，所以要跳过一样的数字。

package suda.alex.leetcode;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class CombinationSum2 {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner scanner = new Scanner(System.in);
        System.out.println("input the size of num:");
        int len = scanner.nextInt();
        System.out.println("input num:");
        int[] num = new int[len];
        for (int i = 0; i < len; i++) {
            num[i] = scanner.nextInt();
        }
        System.out.println("input target:");
        int target = scanner.nextInt();
        ArrayList<ArrayList<Integer>> resultLists = combinationSum2(num, target);
        for (int i = 0; i < resultLists.size(); i++) {
            for(Integer integer : resultLists.get(i)){
                System.out.print(integer + " ");
            }
            System.out.println();

        }
    }
    public static ArrayList<ArrayList<Integer>> combinationSum2(int[] num, int target) {
        ArrayList<ArrayList<Integer>> resultLists = new ArrayList<ArrayList<Integer>>();
        ArrayList<Integer> list = new ArrayList<Integer>();
        if(num.length == 0){
            return resultLists;
        }
        Arrays.sort(num);
        DFS(num, 0, target, list, resultLists);
        return resultLists;
    }
    public static void DFS(int[] num, int start, int target, ArrayList<Integer> list, ArrayList<ArrayList<Integer>> resultLists) {
        if(target == 0){
            resultLists.add(new ArrayList<Integer>(list));
            return;
        }
        if(start >= num.length || num[0] > target){
            return;
        }
        int i = start;
        while (i < num.length) {
            if(num[i] <= target){
                list.add(num[i]);
                DFS(num, i + 1, target - num[i], list, resultLists);
                //回溯 
                list.remove(list.size() - 1);
                //跳过重复的元素  
                while(i < (num.length -1) && num[i] == num[i + 1]){
                    i++;
                }
            }
            i++;
        }
    }

}