【leetcode】【78】Subsets

一、问题描述

Given a set of distinct integers, 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,3], a solution is:

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

二、问题分析

典型的backtracking问题。已经写过很多了，就不解释了。

三、Java AC代码

public List<List<Integer>> subsets(int[] nums) {
		List<List<Integer>> list = new ArrayList<List<Integer>>();
		List<Integer> item = new ArrayList<Integer>();
		Arrays.sort(nums);
		dfsHelper(list, item, nums, 0);
		return list;
	}
	private void dfsHelper(List<List<Integer>> list, List<Integer> item, int[] nums, int start){
		if (item.size()<=nums.length) {
			list.add(new ArrayList<Integer>(item));
		}
		for (int i = start; i < nums.length; i++) {
			item.add(nums[i]);
			dfsHelper(list, item, nums, i+1);
			item.remove(item.size()-1);
		}
	}