![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
#DFS&BFS
TechJungle
这个作者很懒,什么都没留下…
展开
-
LeetCode Backtracking 46 Permutations 47 Permutationsll
46. PermutationsGiven a collection of distinct integers, return all possible permutations.Example:Input: [1,2,3]Output:[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]solution由于是要得到所有的排...原创 2019-12-22 00:53:46 · 99 阅读 · 0 评论 -
LeetCode DFS 78 Subsets 90 Subsets ll
SubsetsGiven a set of distinct integers, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.Example:Input: nums = [1,2,3]Output:[[3],...原创 2019-12-21 13:24:29 · 94 阅读 · 0 评论