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],
[]
]
本题和77一样都运用了backtrack回溯法
非常巧妙
每一次递归都是list下一位
每一次都是循环当前位加1需要好好理解
class Solution {
public List<List<Integer>> subsets(int[] nums) {
List<List<Integer>> res = new ArrayList<>();
List<Integer> temp = new ArrayList<>();
dfs(res,temp,nums,0);
return res;
}
public void dfs(List<List<Integer>> res, List<Integer> temp, int[] nums, int j){
res.add(new ArrayList<Integer>(temp));
for(int i = j;i<nums.length;i++){
temp.add(nums[i]);
dfs(res,temp,nums,i+1);
temp.remove(temp.size()-1);
}
}
}