题目描述
给你一个整数数组 nums ,返回该数组所有可能的子集(幂集)。解集不能包含重复的子集。
示例 1:
输入:nums = [1,2,3]
输出:[[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]
示例 2:
输入:nums = [0]
输出:[[],[0]]
Java代码
1. 暴力
public List<List<Integer>> subsets(int[] nums) {
if (nums.length == 0) return null;
List<List<Integer>> res = new ArrayList<>();
res.add(new ArrayList<>());
for (int num: nums) {
int len = res.size();
for (int i = 0; i < len; i++) {
List<Integer> cur = new ArrayList<>(res.get(i));
cur.add(num);
res.add(cur);
}
}
return res;
}
2. 回溯
public List<List<Integer>> subsets(int[] nums) {
if (nums.length == 0||nums == null) return null;
List<List<Integer>> res = new ArrayList<>();
for (int len = 0; len <= nums.length; len++)
backtracking(nums, len ,0, res, new ArrayList<Integer>());
return res;
}
public void backtracking(int[] nums, int len, int startIndex, List<List<Integer>> res, List<Integer> cur) {
if (cur.size() == len) {
res.add(new ArrayList<>(cur));
return;
}
for (int i = startIndex; i < nums.length; i++) {
if (cur.contains(nums[i])) continue;
cur.add(nums[i]);
backtracking(nums, len , i + 1, res, cur);
cur.remove(cur.size() - 1);
}
}
3. DFS
public List<List<Integer>> subsets(int[] nums) {
if (nums.length == 0||nums == null) return null;
List<List<Integer>> res = new ArrayList<>();
dfs(nums, 0, res, new ArrayList<>());
return res;
}
public void dfs(int[] nums, int startIndex, List<List<Integer>> res, List<Integer> cur) {
res.add(new ArrayList<>(cur));
for (int i = startIndex; i < nums.length; i++) {
cur.add(nums[i]);
dfs(nums, i + 1, res, cur);
cur.remove(cur.size() - 1);
}
}