Subsets （backtracking）

Given a set of distinct integers, nums, return all possible subsets.

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

代码如下：

import java.util.ArrayList;import java.util.Arrays;import java.util.List;public class Subsets {public List<ArrayList<Integer>> subsets(int[] nums){List<ArrayList<Integer>> list = new ArrayList<>();Arrays.sort(nums);backtrack(list,new ArrayList<>(),nums,0);return list;}private void backtrack(List<ArrayList<Integer>> list, ArrayList<Integer> arrayList, int[] nums, int start) {list.add(arrayList);for(int i=0;i<nums.length;i++){arrayList.add(nums[i]);backtrack(list,arrayList,nums,i+1);arrayList.remove(arrayList.size()-1);}}}