递归-数组的子集:leetcode 78 Subsets
2017-04-21 17:59
441 查看
leetcode 78 Subsets
public class Solution {
public List<List<Integer>> subsets(int[] nums) {
List<List<Integer>> result = new ArrayList<List<Integer>>();
if(nums.length == 0){
return result;
}
Arrays.sort(nums);
dfs(nums, 0, new ArrayList<Integer>(), result);
return result;
}
public void dfs(int[] nums, int index, List<Integer> path, List<List<Integer>> result)
{
// result.add(path); path的地址是不变的,且初始里面为空。若这样写,result里全是空list
result.add(new ArrayList<Integer>(path));
for(int i = index; i < nums.length; i++){
path.add(nums[i]);
dfs(nums, i+1, path, result);
path.remove(path.size()-1);
}
}
}
public class Solution {
public List<List<Integer>> subsets(int[] nums) {
List<List<Integer>> result = new ArrayList<List<Integer>>();
if(nums.length == 0){
return result;
}
Arrays.sort(nums);
dfs(nums, 0, new ArrayList<Integer>(), result);
return result;
}
public void dfs(int[] nums, int index, List<Integer> path, List<List<Integer>> result)
{
// result.add(path); path的地址是不变的,且初始里面为空。若这样写,result里全是空list
result.add(new ArrayList<Integer>(path));
for(int i = index; i < nums.length; i++){
path.add(nums[i]);
dfs(nums, i+1, path, result);
path.remove(path.size()-1);
}
}
}
相关文章推荐
- LeetCode - 78 - Subsets(求数组全部子集)
- LeetCode 78 Subsets (所有子集)
- Leetcode 78 Subsets(打印全部子集)
- leetcode78、90-Subsets I/II(组合数/子集数目)
- Leetcode:Subsets 求数组的所有子集
- [LeetCode]—Subsets 求数组子集
- leetcode_78——Subsets(基于DFS的递归,基于同质的递推)
- leetcode解题之 77. Combinations&78. Subsets&90. Subsets II java 版(求所有子集)
- Leetcode:Subsets 求数组的所有子集
- [Leetcode] subsets 求数组所有的子集
- 两种回溯方法解决子集问题的思路 leetcode 78. Subsets
- Leetcode:Subsets 求数组的所有子集(DFS)
- [LeetCode]—Subsets II 求数组子集(有重复值)
- Leetcode 78. Subsets
- 【LeetCode】C# 78、Subsets
- Subsets 子集系列问题 leetcode
- 【LeetCode】78_Subsets
- leetcode 78 Subsets
- LeetCode-78-Subsets 水题暴力
- Leetcode 78. Subsets