Leetcode 78 Subsets

Problem Definition

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

Solutions

solutions1: backtracking

First, i’d like to try backtracking method.

class Solution {
   public List<List<Integer>> subsets(int[] nums) {
       if(nums == null || nums.length == 0)    return new ArrayList<List<Integer>>();
       List<List<Integer>> res = new ArrayList();
       Arrays.sort(nums);
       help(res, new ArrayList<Integer>(), nums, 0);
       return res;
   }
   
   public void help(List<List<Integer>> res, List<Integer> cur, int[] nums, int index){
       res.add(new ArrayList(cur));
       for(int i = index; i < nums.length; i++){
           cur.add(nums[i]);
           help(res, cur, nums, i + 1);
           cur.remove(cur.size() - 1);
       }
   }
}

The adding process is:
[]
[1]
[1,2]
[1,2,3]
[1,3]
[2]
[2,3]
[3]
time complexity:
there are N numbers and 2 decision ( whether to include or leave a number )
[1,2,3]
[1(include/leave), 2(include/leave), 3(include/leave)]
222 = 2^3
so 2^N

time complexity.

process.