## 广度优先搜索

| \# | 题名 | 题解 | 通过率 | 难度 | 出现频率   |
|------|----------------------|-----|--------|----|--------|
|913|[猫和老鼠](https://leetcode-cn.com/problems/cat-and-mouse)   |[10](https://leetcode-cn.com/problems/cat-and-mouse/solution)|26.4%|困难|71.36%|
|1236|[Web Crawler](https://leetcode-cn.com/problems/web-crawler)   |[4](https://leetcode-cn.com/problems/web-crawler/solution)|52.5%|中等|46.1%|
|864|[获取所有钥匙的最短路径](https://leetcode-cn.com/problems/shortest-path-to-get-all-keys)   |[14](https://leetcode-cn.com/problems/shortest-path-to-get-all-keys/solution)|38.8%|困难|45.59%|
|773|[滑动谜题](https://leetcode-cn.com/problems/sliding-puzzle)   |[10](https://leetcode-cn.com/problems/sliding-puzzle/solution)|56.2%|困难|40.38%|
|1036|[逃离大迷宫](https://leetcode-cn.com/problems/escape-a-large-maze)   |[10](https://leetcode-cn.com/problems/escape-a-large-maze/solution)|25.0%|困难|39.65%|
|815|[公交路线](https://leetcode-cn.com/problems/bus-routes)   |[10](https://leetcode-cn.com/problems/bus-routes/solution)|29.5%|困难|39.29%|
|407|[接雨水 II](https://leetcode-cn.com/problems/trapping-rain-water-ii)   |[15](https://leetcode-cn.com/problems/trapping-rain-water-ii/solution)|32.9%|困难|37.06%|
|200|[岛屿数量](https://leetcode-cn.com/problems/number-of-islands)   |[125](https://leetcode-cn.com/problems/number-of-islands/solution)|46.3%|中等|36.08%|
|199|[二叉树的右视图](https://leetcode-cn.com/problems/binary-tree-right-side-view)   |[83](https://leetcode-cn.com/problems/binary-tree-right-side-view/solution)|62.2%|中等|35.65%|
|301|[删除无效的括号](https://leetcode-cn.com/problems/remove-invalid-parentheses)   |[15](https://leetcode-cn.com/problems/remove-invalid-parentheses/solution)|44.5%|困难|32.67%|
|279|[完全平方数](https://leetcode-cn.com/problems/perfect-squares)   |[76](https://leetcode-cn.com/problems/perfect-squares/solution)|51.9%|中等|32.39%|
|1162|[地图分析](https://leetcode-cn.com/problems/as-far-from-land-as-possible)   |[30](https://leetcode-cn.com/problems/as-far-from-land-as-possible/solution)|36.6%|中等|32.17%|
|675|[为高尔夫比赛砍树](https://leetcode-cn.com/problems/cut-off-trees-for-golf-event)   |[7](https://leetcode-cn.com/problems/cut-off-trees-for-golf-event/solution)|31.4%|困难|30.02%|
|743|[网络延迟时间](https://leetcode-cn.com/problems/network-delay-time)   |[24](https://leetcode-cn.com/problems/network-delay-time/solution)|44.7%|中等|27.01%|
|126|[单词接龙 II](https://leetcode-cn.com/problems/word-ladder-ii)   |[35](https://leetcode-cn.com/problems/word-ladder-ii/solution)|30.3%|困难|26.8%|
|102|[二叉树的层次遍历](https://leetcode-cn.com/problems/binary-tree-level-order-traversal)   |[147](https://leetcode-cn.com/problems/binary-tree-level-order-traversal/solution)|60.0%|中等|25.37%|
|847|[访问所有节点的最短路径](https://leetcode-cn.com/problems/shortest-path-visiting-all-nodes)   |[11](https://leetcode-cn.com/problems/shortest-path-visiting-all-nodes/solution)|50.6%|困难|24.77%|
|103|[二叉树的锯齿形层次遍历](https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal)   |[121](https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/solution)|52.8%|中等|24.53%|
|1091|[二进制矩阵中的最短路径](https://leetcode-cn.com/problems/shortest-path-in-binary-matrix)   |[21](https://leetcode-cn.com/problems/shortest-path-in-binary-matrix/solution)|27.1%|中等|23.76%|
|505|[迷宫 II](https://leetcode-cn.com/problems/the-maze-ii)   |[10](https://leetcode-cn.com/problems/the-maze-ii/solution)|42.0%|中等|23.58%|
|286|[墙与门](https://leetcode-cn.com/problems/walls-and-gates)   |[16](https://leetcode-cn.com/problems/walls-and-gates/solution)|41.6%|中等|23.58%|
|101|[对称二叉树](https://leetcode-cn.com/problems/symmetric-tree)   |[153](https://leetcode-cn.com/problems/symmetric-tree/solution)|49.2%|简单|23.48%|
|515|[在每个树行中找最大值](https://leetcode-cn.com/problems/find-largest-value-in-each-tree-row)   |[26](https://leetcode-cn.com/problems/find-largest-value-in-each-tree-row/solution)|56.9%|中等|23%|
|863|[二叉树中所有距离为 K 的结点](https://leetcode-cn.com/problems/all-nodes-distance-k-in-binary-tree)   |[26](https://leetcode-cn.com/problems/all-nodes-distance-k-in-binary-tree/solution)|44.6%|中等|22.58%|
|542|[01 矩阵](https://leetcode-cn.com/problems/01-matrix)   |[27](https://leetcode-cn.com/problems/01-matrix/solution)|37.1%|中等|21.95%|
|310|[最小高度树](https://leetcode-cn.com/problems/minimum-height-trees)   |[21](https://leetcode-cn.com/problems/minimum-height-trees/solution)|32.9%|中等|21.8%|
|994|[腐烂的橘子](https://leetcode-cn.com/problems/rotting-oranges)   |[29](https://leetcode-cn.com/problems/rotting-oranges/solution)|46.2%|简单|20.45%|
|909|[蛇梯棋](https://leetcode-cn.com/problems/snakes-and-ladders)   |[8](https://leetcode-cn.com/problems/snakes-and-ladders/solution)|27.8%|中等|19.83%|
|207|[课程表](https://leetcode-cn.com/problems/course-schedule)   |[57](https://leetcode-cn.com/problems/course-schedule/solution)|48.5%|中等|18.71%|
|499|[迷宫 III](https://leetcode-cn.com/problems/the-maze-iii)   |[11](https://leetcode-cn.com/problems/the-maze-iii/solution)|29.1%|困难|17.74%|
|133|[克隆图](https://leetcode-cn.com/problems/clone-graph)   |[47](https://leetcode-cn.com/problems/clone-graph/solution)|47.9%|中等|17.12%|
|130|[被围绕的区域](https://leetcode-cn.com/problems/surrounded-regions)   |[59](https://leetcode-cn.com/problems/surrounded-regions/solution)|38.6%|中等|17.05%|
|1245|[树的直径](https://leetcode-cn.com/problems/tree-diameter)   |[7](https://leetcode-cn.com/problems/tree-diameter/solution)|39.6%|中等|16.58%|
|107|[二叉树的层次遍历 II](https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii)   |[111](https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/solution)|63.5%|简单|16.17%|
|934|[最短的桥](https://leetcode-cn.com/problems/shortest-bridge)   |[20](https://leetcode-cn.com/problems/shortest-bridge/solution)|42.6%|中等|16.01%|
|559|[N叉树的最大深度](https://leetcode-cn.com/problems/maximum-depth-of-n-ary-tree)   |[44](https://leetcode-cn.com/problems/maximum-depth-of-n-ary-tree/solution)|67.5%|简单|14.96%|
|111|[二叉树的最小深度](https://leetcode-cn.com/problems/minimum-depth-of-binary-tree)   |[110](https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/solution)|40.8%|简单|14.85%|
|1129|[颜色交替的最短路径](https://leetcode-cn.com/problems/shortest-path-with-alternating-colors)   |[18](https://leetcode-cn.com/problems/shortest-path-with-alternating-colors/solution)|33.2%|中等|14.11%|
|417|[太平洋大西洋水流问题](https://leetcode-cn.com/problems/pacific-atlantic-water-flow)   |[17](https://leetcode-cn.com/problems/pacific-atlantic-water-flow/solution)|39.3%|中等|13.81%|
|785|[判断二分图](https://leetcode-cn.com/problems/is-graph-bipartite)   |[27](https://leetcode-cn.com/problems/is-graph-bipartite/solution)|41.9%|中等|13.34%|
|127|[单词接龙](https://leetcode-cn.com/problems/word-ladder)   |[44](https://leetcode-cn.com/problems/word-ladder/solution)|38.5%|中等|12.87%|
|690|[员工的重要性](https://leetcode-cn.com/problems/employee-importance)   |[25](https://leetcode-cn.com/problems/employee-importance/solution)|55.4%|简单|12.84%|
|513|[找树左下角的值](https://leetcode-cn.com/problems/find-bottom-left-tree-value)   |[48](https://leetcode-cn.com/problems/find-bottom-left-tree-value/solution)|67.4%|中等|11.41%|
|210|[课程表 II](https://leetcode-cn.com/problems/course-schedule-ii)   |[38](https://leetcode-cn.com/problems/course-schedule-ii/solution)|45.5%|中等|11.26%|
|429|[N叉树的层序遍历](https://leetcode-cn.com/problems/n-ary-tree-level-order-traversal)   |[60](https://leetcode-cn.com/problems/n-ary-tree-level-order-traversal/solution)|63.8%|中等|11.18%|
|490|[迷宫](https://leetcode-cn.com/problems/the-maze)   |[13](https://leetcode-cn.com/problems/the-maze/solution)|43.7%|中等|11.04%|
|323|[无向图中连通分量的数目](https://leetcode-cn.com/problems/number-of-connected-components-in-an-undirected-graph)   |[21](https://leetcode-cn.com/problems/number-of-connected-components-in-an-undirected-graph/solution)|52.7%|中等|10.25%|
|787|[K 站中转内最便宜的航班](https://leetcode-cn.com/problems/cheapest-flights-within-k-stops)   |[15](https://leetcode-cn.com/problems/cheapest-flights-within-k-stops/solution)|34.0%|中等|9.64%|
|752|[打开转盘锁](https://leetcode-cn.com/problems/open-the-lock)   |[37](https://leetcode-cn.com/problems/open-the-lock/solution)|47.8%|中等|8.89%|
|529|[扫雷游戏](https://leetcode-cn.com/problems/minesweeper)   |[21](https://leetcode-cn.com/problems/minesweeper/solution)|57.9%|中等|6.77%|
|993|[二叉树的堂兄弟节点](https://leetcode-cn.com/problems/cousins-in-binary-tree)   |[40](https://leetcode-cn.com/problems/cousins-in-binary-tree/solution)|49.2%|简单|6.05%|
|1293|[网格中的最短路径](https://leetcode-cn.com/problems/shortest-path-in-a-grid-with-obstacles-elimination)   |[28](https://leetcode-cn.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/solution)|34.6%|困难|3.82%|
|1284|[转化为全零矩阵的最少反转次数](https://leetcode-cn.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix)   |[30](https://leetcode-cn.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/solution)|64.3%|困难|3.82%|
|1298|[你能从盒子里获得的最大糖果数](https://leetcode-cn.com/problems/maximum-candies-you-can-get-from-boxes)   |[27](https://leetcode-cn.com/problems/maximum-candies-you-can-get-from-boxes/solution)|56.4%|困难|&nbsp;|
|1263|[推箱子](https://leetcode-cn.com/problems/minimum-moves-to-move-a-box-to-their-target-location)   |[20](https://leetcode-cn.com/problems/minimum-moves-to-move-a-box-to-their-target-location/solution)|40.4%|困难|&nbsp;|
|1242|[多线程网页爬虫](https://leetcode-cn.com/problems/web-crawler-multithreaded)   |[3](https://leetcode-cn.com/problems/web-crawler-multithreaded/solution)|35.9%|中等|&nbsp;|
|1210|[穿过迷宫的最少移动次数](https://leetcode-cn.com/problems/minimum-moves-to-reach-target-with-rotations)   |[11](https://leetcode-cn.com/problems/minimum-moves-to-reach-target-with-rotations/solution)|41.7%|困难|&nbsp;|
|1197|[进击的骑士](https://leetcode-cn.com/problems/minimum-knight-moves)   |[9](https://leetcode-cn.com/problems/minimum-knight-moves/solution)|27.4%|中等|&nbsp;|
|854|[相似度为 K 的字符串](https://leetcode-cn.com/problems/k-similar-strings)   |[15](https://leetcode-cn.com/problems/k-similar-strings/solution)|26.3%|困难|&nbsp;|
|317|[离建筑物最近的距离](https://leetcode-cn.com/problems/shortest-distance-from-all-buildings)   |[11](https://leetcode-cn.com/problems/shortest-distance-from-all-buildings/solution)|40.6%|困难|&nbsp;|
|261|[以图判树](https://leetcode-cn.com/problems/graph-valid-tree)   |[19](https://leetcode-cn.com/problems/graph-valid-tree/solution)|42.7%|中等|&nbsp;|

