![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
dfs
qch60925
这个作者很懒,什么都没留下…
展开
-
123的全排列力扣dfs
public List<List<Integer>> permute(int[] nums) { List<List<Integer>> list = new ArrayList<>(); List<Integer> list1=new ArrayList<>(); dfs(nums,list,list1); return list; } pub原创 2021-05-19 21:55:38 · 151 阅读 · 0 评论 -
力扣19--DFS-电话号码的组合
public List<String> letterCombinations(String digits) { if(digits.length()==0) return ans; dfs(digits,new StringBuilder(),0); return ans; } public void dfs(String s, StringBuilder res, int index){ //递归终止条件原创 2021-05-19 21:54:35 · 62 阅读 · 0 评论