Subsets by LeetCode
java编写
public class Subsets {
public static void main(String[] args) {
int[] a = {1,2,3};
subsets(a);
}
public static List<List> subsets(int[] nums) {
List<List> result = new ArrayList<>();
if (nums == null) {
return result;
}
DFS(nums, 0, new ArrayList<>(), result);
return result;
}
private static void DFS(int[] nums, int level, List curr, List<List> result) {
if (level == nums.length) {
for(int x:curr) {
System.out.print(x+" ");
}
System.out.println();
result.add(new ArrayList<>(curr));
return;
}
curr.add(nums[level]);
DFS(nums, level + 1, curr, result);(1)
curr.remove(curr.size()-1);
DFS(nums, level + 1, curr, result);(2)
}
}
这题想了很久,没写出来,可能今天不太写hhh,例子【1,2,3】中找出所有子字符串,
这个答案用了dfs很巧妙,我感觉我自己也写不出这个,有点难想到。先是123,然后退出(1)
然后除掉3,只有12,然后进入(2)level也为3;输出12,然后继续回溯下去,我觉得这个方法真的很好,应该是个大佬写的,要么就是我太辣鸡了hhh。
Subsets(Medium)
最新推荐文章于 2021-04-24 00:12:04 发布