![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
dfs
文章平均质量分 70
Lynn_Baby
这个作者很懒,什么都没留下…
展开
-
LeetCode—permutations_combinations_permutations-sequence(全排列——DFS深度优先搜索)—java
题目描述:Given a collection of numbers, return all possible permutations.For example,[1,2,3]have the following permutations:[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2], and[3,2,1].思路解析:https://blog.csdn.net/L...原创 2018-06-21 20:03:16 · 304 阅读 · 0 评论 -
LeetCode—subsets(子集dfs)—java
题目描述:Given a set of distinct integers, S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.For example,If S =[1...原创 2018-07-15 00:13:04 · 887 阅读 · 0 评论