leetcode刷题_OJ 78

Given a set of distinct integers, nums, return all possible subsets (the power set).

Note: The solution set must not contain duplicate subsets.

Example:

Input: nums = [1,2,3]
Output:
[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]
题目的意思：给一个集合，输出它的所有子集

明显的回溯法实现，要注意的地方图中注释有说明：

class Solution {
    public List<List<Integer>> subsets(int[] nums) {
        List<List<Integer>> result=new ArrayList<List<Integer>>();
        List<Integer> subset=new ArrayList<Integer>();
        BackTrack(result,subset,nums,0);
        return result;
    }

    private void BackTrack(List<List<Integer>> result,List<Integer> subset,int[] nums,int start){
        result.add(new ArrayList<Integer>(subset));//add的应该是subset的拷贝，而不是一直在被修改的subset本身
        for(int i=start;i<nums.length;i++){
            subset.add(nums[i]);
            BackTrack(result,subset,nums,i+1);
            subset.remove(subset.size()-1);
        }
    }

}