Level:
Medium
题目描述:
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], []]
思路分析:
求子组合问题,这种题的解法都是回溯进行遍历,将满足要求的解返回。
代码:
public class Solution{ public List
>subsets(int nums[]){ List
>res=new ArrayList<>(); if(nums==null||nums.length==0) return res; Arrays.sort(nums); //进行排序,按要求顺序输出 back(res,nums,new ArrayList<>(),0); return res; } public void back(List
>res,int []nums,List list,int start){ res.add(new ArrayList<>(list)); for(int i=start;i