[Leetcode] 90. Subsets II

Given a collection of integers that might contain duplicates, S, 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 S = [1,2,2], a solution is:

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

import java.util.ArrayList;
public class Solution {
    public ArrayList<ArrayList<Integer>> subsetsWithDup(int[] num) {
        ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
        if(num == null || num.length == 0) return result;
        Arrays.sort(num);
        ArrayList<Integer> list = new ArrayList<Integer>();
        helper(num, result, list, 0);
        return result;
    }
    private void helper(int[] num, ArrayList<ArrayList<Integer>> result, ArrayList<Integer> list, int start){
        result.add(new ArrayList<Integer>(list));
        for(int i = start; i < num.length; i++){
            if(i > start && num[i] == num[i - 1]){
                continue;
            }
            list.add(num[i]);
            subsets(num, list, result, i + 1);
            list.remove(list.size() - 1);
        }
    }
}