[LeetCode] questions conclustion_BFS, DFS
BFS, DFS 的题目总结.
Directed graph:
Directed Graph Loop detection and if not have, path to print all path.
BFS/DFS: (可以用BFS或者DFS的,主要还是遍历)
[LeetCode] 733. Flood Fill_Easy tag: BFS 1
[LeetCode] 690. Employee Importance_Easy tag: BFS 1
[LeetCode] 529. Minesweeper_ Medium_ tag: BFS
[LeetCode] 200. Number of Islands_ Medium tag: BFS
[LeetCode] 133. Clone Graph_ Medium tag: BFS, DFS
[LeetCode] 261. Graph Valid Tree _ Medium tag: BFS
[LeetCode] 301. Remove Invalid Parentheses_Hard tag:BFS
[LeetCode] 104. Maximum Depth of Binary Tree_Easy tag: DFS
[LeetCode] 827. Making A Large Island
[LeetCode] 695. Max Area of Island_Easy tag: DFS/BFS
[LeetCode] 490. The Maze_Medium tag: BFS/DFS
[LeetCode] 130. Surrounded Regions_Medium tag: DFS
BFS(shortest path/distance, level traversal)
[Leetcode] 863. All Nodes Distance K in Binary Tree_ Medium tag: BFS, Amazon 1
[LeetCode] 199. Binary Tree Right Side View_ Medium tag: BFS, Amazon
[LeetCode] 102. Binary Tree Level Order Traversal_Medium tag: BFS
[LeetCode] 127. Word Ladder _Medium tag: BFS
[LeetCode] 675. Cut Off Trees for Golf Event_Hard tag: BFS
[LeetCode] 103. Binary Tree Zigzag Level Order Traversal _ Medium tag: BFS
[LeetCode] 101. Symmetric Tree_ Easy tag: BFS
[LeetCode] 513. Find Bottom Left Tree Value_ Medium tag: BFS
[LeetCode] 286. Walls and Gates_Medium tag: BFS
[LeetCode] 310. Minimum Height Trees_Medium tag: BFS
DFS
[LeetCode] 207 Course Schedule_Medium tag: BFS, DFS 1
[LeetCode] 785. Is Graph Bipartite?_Medium tag: DFS, BFS
[LeetCode] 210. Course Schedule II
[LeetCode] 694. Number of Distinct Islands
[LeetCode] 711. Number of Distinct Islands II_hard tag: DFS
[LeetCode] 851. Loud and Rich_ Medium tag: DFS
[LeetCode] 112. Path Sum_Easy tag: DFS
[LeetCode] 114. Flatten Binary Tree to Linked List_Medium tag: DFS
[LeetCode] 257. Binary Tree Paths_ Easy tag: DFS
[LeetCode] 437. Path Sum III_ Easy tag: DFS
[LeetCode] 124. Binary Tree Maximum Path Sum_ Hard tag: DFS recursive
[LeetCode] 687. Longest Univalue Path_Easy tag: DFS recursive
[LeetCode] 298. Binary Tree Longest Consecutive Sequence_Medium tag: DFS recursive
[LeetCode] 549. Binary Tree Longest Consecutive Sequence II_ Medium tag: DFS recursive
[LeetCode] 721. Accounts Merge_Medium tag: DFS recursive
[LeetCode] 111. Minimum Depth of Binary Tree_Easy tag:DFS
[LeetCode] 110. Balanced Binary Tree_Easy tag: DFS
[LeetCode] 100. Same Tree_Easy tag: DFS
[LeetCode] 99. Recover Binary Search Tree
[LeetCode] 129. Sum Root to Leaf Numbers_Medium tag: DFS
[LeetCode] 559. Maximum Depth of N-ary Tree_Easy tag: DFS
[LeetCode] questions conclustion_BFS, DFS的更多相关文章
- All LeetCode Questions List 题目汇总
All LeetCode Questions List(Part of Answers, still updating) 题目汇总及部分答案(持续更新中) Leetcode problems clas ...
- Summary: curated List of Top 75 LeetCode Questions to Save Your Time
Facebook / Eng tech lead Dec 30, 2018 68 Comments New Year Gift to every fellow time-constrained ...
- LeetCode Subsets (DFS)
题意: 给一个集合,有n个互不相同的元素,求出所有的子集(包括空集,但是不能重复). 思路: DFS方法:由于集合中的元素是不可能出现相同的,所以不用解决相同的元素而导致重复统计. class Sol ...
- [LeetCode] questions conclusion_ Binary Search
Binary Search T(n) = T(n/2) + O(1) => T(n) = O(lg n) proof: 如果能用iterable , 就用while loop, 可以防 ...
- [LeetCode] questions conlusion_InOrder, PreOrder, PostOrder traversal
Pre: node 先, Inorder: node in, Postorder: node 最后 PreOrder Inorde ...
- [LeetCode] questions conclusion_ Dynamic Programming
Questions: [LeetCode] 198. House Robber _Easy tag: Dynamic Programming [LeetCode] 221. Maximal Squar ...
- [LeetCode] questions conclustion_Path in Tree
Path in Tree: [LeetCode] 112. Path Sum_Easy tag: DFS input: root, target, return True if exi ...
- Leetcode总结之DFS
package DFS; import java.util.ArrayList; import java.util.HashMap; import java.util.LinkedList; impo ...
- LeetCode刷题 DFS+回溯
一.DFS介绍 二.LeetCode 实战 LC 17. 电话号码的字母组合 解法思路 解题步骤 代码 LC 79. 单词搜索 解题思路 解题步骤 代码 LC 46. 全排列 解题思路一 解题步骤 代 ...
随机推荐
- Esper学习之一:Esper介绍
CEP即Complex Event Process,中文意思就是“复杂事件处理”.听起来好像很复杂,实际上就是基于事件流进行数据处理,把要分析的数据抽象成事件,然后将数据发送到CEP引擎,引擎就会根据 ...
- 题目1453:Greedy Tino(dp题目)
题目链接:http://ac.jobdu.com/problem.php?pid=1453 详解链接:https://github.com/zpfbuaa/JobduInCPlusPlus 参考代码: ...
- 盘古分词修改支持mono和lucene.net3.03
盘古分词平台兼容性 在使用Lucece.net,需要一个中文的分词组件,比较好的是盘古分词,但是我希望能够在mono的环境下运行,就使用moma检查了一下盘古分词 Assembly Version M ...
- Pexpect学习:
pexecpt run用法:格式:run(command,timeout=-1,withexitstatus=False,events=None,extra_args=None,logfile=Non ...
- python之接口
首先,我们必须明确的一点是:python里无接口类型,定义接口只是一个人为规定,在编程过程自我约束 python的类是可以写任意个方法的 定义一个接口对继承类进行约束,接口里有什么方法,继承类就必须有 ...
- thinkCMF----增删改查操作
thinkCMF的增删改查基本操作: 一.增加数据 $res = Db::name('form')->insert($data); 示例代码: public function index(){ ...
- 51nod1432 独木舟
1432 独木舟 基准时间限制:1 秒 空间限制:131072 KB 分值: 10 难度:2级算法题 收藏 关注 n个人,已知每个人体重.独木舟承重固定,每只独木舟最多坐两个人,可以坐一个人或者 ...
- slam学习资源
从零开始学slam: http://blog.csdn.net/akunainiannian/article/details/45363731 史上最全的SLAM学习资料收集 http://www. ...
- 用纯css实现下拉菜单的几种方式
第一种:display:none和display:block切换 <!DOCTYPE html> <html lang="en"> <head> ...
- 【紫书】 Unix ls UVA - 400 模拟
题意:中文版https://vjudge.net/problem/UVA-400#author=Zsc1615925460 题解:首先读取字符,维护一个最长字符串长度M,再排序. 对于输出,写一个pr ...