Medium 78题 Subsets

Question:

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

Solution

public class Solution {
    public List<List<Integer>> subsets(int[] nums) {
        List<List<Integer>> ans=new ArrayList<List<Integer>>();
        int n=nums.length;
        f(ans,new ArrayList<Integer>(),nums,0);
        
        return ans;
    }
    public void f(List<List<Integer>> ans, List<Integer> tmp, int[] nums, int start)
    {
        ans.add(new ArrayList<Integer>(tmp));
        for(int i=start;i<=nums.length-1;i++)
        {
            tmp.add(nums[i]);
            f(ans,tmp,nums,i+1);
            tmp.remove(tmp.size()-1);
        }
    }
    
}

下面这种结合了combination3的解法 就是k=3,n=7，这里是把k的所有情况都要包含进来，故，只需要在主函数中加一个循环即可，上面那种方法还没太想明白，哦原来就是不管k等于几都加入进去

public class Solution {
   public List<List<Integer>> subsets(int[] nums) {
        List<List<Integer>> ans = new ArrayList<List<Integer>>();
        List<Integer> cur = new ArrayList<Integer>();
        for(int k=0;k<=nums.length;k++)
            dfs(ans,new ArrayList<Integer>(),k,0,nums);
        return ans;
        
    }
    public void dfs(List<List<Integer>> ans, List<Integer> comb, int k,  int start, int[] nums) {
        if(comb.size()==k)
        {
            ans.add(new ArrayList<Integer>(comb));
            return;
        }
             
        for(int i=start;i<=nums.length-1;i++)
        {
            comb.add(nums[i]);
            dfs(ans,comb,k,i+1,nums);
            comb.remove(comb.size()-1);
        }
        
    }    
}