[leetcode]90. Subsets II(Java)

https://leetcode.com/problems/subsets-ii/#/description

Given a collection of integers that might contain duplicates, nums, return all possible subsets.

Note: 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],
  []
]

package go.jacob.day703;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class Demo3 {
	/*
	 * Runtime: 2 ms.Your runtime beats 69.62 % of java submissions.
	 */
	public List<List<Integer>> subsetsWithDup(int[] nums) {
		List<List<Integer>> res = new ArrayList<List<Integer>>();
		if (nums == null || nums.length < 1)
			return res;
		Arrays.sort(nums);
		ArrayList<Integer> list = new ArrayList<Integer>();
		solve(nums, 0, res, list);
		return res;
	}

	private void solve(int[] nums, int start, List<List<Integer>> res, ArrayList<Integer> list) {
		res.add(new ArrayList<Integer>(list));
		if (start >= nums.length)
			return;
		for (int i = start; i < nums.length; i++) {
			if (i > start && nums[i] == nums[i - 1])
				continue;
			list.add(nums[i]);
			solve(nums, i + 1, res, list);
			list.remove(list.size() - 1);
		}
	}
}