我的LeetCode代码仓:https://github.com/617076674/LeetCode
原题链接:https://leetcode-cn.com/problems/subsets/description/
题目描述:
知识点:递归、回溯
思路:回溯法穷举数组所有子集
本题和LeetCode077——组合虽然题目不尽相同,但思路却是一模一样。
时间复杂度是O(2 ^ n),其中n为nums数组的长度。空间复杂度即递归深度,是O(n)。
JAVA代码:
public class Solution {
private List<List<Integer>> listList;
public List<List<Integer>> subsets(int[] nums) {
listList = new ArrayList<>();
for (int i = 0; i <= nums.length; i++) {
subSets(nums, new ArrayList<>(), i);
}
return listList;
}
private void subSets(int[] nums, List<Integer> list, int n){
if(list.size() == n){
listList.add(new ArrayList<>(list));
return;
}
for (int i = 0; i < nums.length; i++) {
if(list.contains(nums[i]) || (!list.isEmpty() && list.get(list.size() - 1) > nums[i])){
continue;
}
list.add(nums[i]);
subSets(nums, list, n);
list.remove(list.size() - 1);
}
}
}
LeetCode解题报告: