Depth-first Search
文章平均质量分 89
Vendredimatin
这个作者很懒,什么都没留下…
展开
-
洛谷搜索题单(BFS/DFS)13道题总结
洛谷搜索题单(BFS/DFS)13道题总结P1219 八皇后经典深搜问题,本题的难点在于如何判断斜线上是否已有棋子,可使用数学中斜率和截距来判断是否是在同一条直线上。P2392 kkksc03考前临时抱佛脚深搜问题,但本题又是01背包问题,把作业分别放进左脑和右脑,最后去左脑和右脑的最大值就是该课的最终结果,一开始想得太复杂了,想把左脑和右脑一起处理。因此应该将搜索简单化,编写代码时尽量简化状态背包容量相当于t/2,最好的结果当然是t/2,意味着左脑和右脑之间没有时间差,即求时间差尽量小,单脑时间原创 2021-07-25 23:43:07 · 1815 阅读 · 0 评论 -
Leetcode 130. Surrounded Regions
Given a 2D board containing ‘X’ and ‘O’ (the letter O), capture all regions surrounded by ‘X’.A region is captured by flipping all 'O’s into 'X’s in that surrounded region.Explanation:Surrounded r...原创 2020-02-09 18:58:22 · 185 阅读 · 0 评论 -
Leetcode 200. Number of Islands
Given a 2d grid map of '1’s (land) and '0’s (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume...原创 2020-02-09 17:47:52 · 245 阅读 · 0 评论 -
leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.For example, givenpreorder = [3,9,20,15,7]inorder = [9,3,15,...原创 2019-06-12 11:35:21 · 100 阅读 · 0 评论