【leetcode-90】SubsetII(java 语言)

问题描述：
Given a collection of integers that might contain duplicates, nums, return all possible subsets.

Note:
Elements in a subset must be in non-descending order.
The solution set must not contain duplicate subsets.
For example,
If nums = [1,2,2], a solution is:

[
[2],
[1],
[1,2,2],
[2,2],
[1,2],
[]
]

解析：二叉树+深搜，注意返回的类型一定要变成List(List())才能过

public class Solution {
    private void dfs(List<List<Integer>> res,ArrayList<Integer> tmpList,int level,int[] nums){
        int length = nums.length;
        if(level==length){
            int tmpLength = tmpList.size();//sorted list
            int resTempLen;
            int i;
            for (List<Integer> resTemp : res) {
                resTempLen = resTemp.size();
                if(resTempLen!=tmpLength)
                    continue;
                for(i = 0;i<resTempLen;i++){
                    if(resTemp.get(i)!=tmpList.get(i))
                        break;
                }
                if(i == resTempLen){
                    return;
                }
            }
            res.add(new ArrayList<Integer>(tmpList));
            return;
        }
        //left,and don't add any element
        dfs(res, tmpList, level+1, nums);
        tmpList.add(nums[level]);
        dfs(res, tmpList, level+1, nums);
        tmpList.remove(tmpList.size()-1);
    }
    public List<List<Integer>> subsetsWithDup(int[] nums) {
        List<List<Integer>> res = new ArrayList<List<Integer>>();
        ArrayList<Integer> tmpList = new ArrayList<Integer>();
        Arrays.sort(nums);

        dfs(res, tmpList, 0, nums);
        return res;
    }
}