CS_learn/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2026-02-02 18:39:09 +08:00
Code Issues Packages Projects Releases Wiki Activity

替换图片链接

Browse Source
This commit is contained in:
programmercarl
2025-03-17 15:52:23 +08:00
parent 91e7dab72c
commit 86a0208485
216 changed files with 813 additions and 813 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/kamacoder/0105.有向图的完全可达性.md
View File

@@ -33,7 +33,7 @@
【提示信息】
![](https://code-thinking-1253855093.file.myqcloud.com/pics/20240522174707.png)
![](https://file.kamacoder.com/pics/20240522174707.png)
从 1 号节点可以到达任意节点，输出 1。
@@ -48,7 +48,7 @@
接下来我们再画一个图，从图里可以直观看出来，节点6 是 不能到达节点1 的
![](https://code-thinking-1253855093.file.myqcloud.com/pics/20240522175451.png)
![](https://file.kamacoder.com/pics/20240522175451.png)
这就很容易让我们想起岛屿问题，只要发现独立的岛，就是不可到达的。