algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-07 07:35:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新图

Browse Source
This commit is contained in:
programmercarl
2025-03-14 18:05:33 +08:00
parent ca2cffabd0
commit 0881fb5e81
1 changed files with 6 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
problems/kamacoder/0110.字符串接龙.md
View File

@ -57,7 +57,11 @@ yhn
2 <= N <= 500 2 <= N <= 500
<p> <p>
<<<<<<< HEAD
<img src="https://code-thinking-1253855093.file.myqcloud.com/pics/20240529121038.png" alt="" width="50%" /> <img src="https://code-thinking-1253855093.file.myqcloud.com/pics/20240529121038.png" alt="" width="50%" />
=======
<img src="../images/0110.字符串接龙-03.png" alt="" width="50%" />
>>>>>>> d0bd2dc5 (更新图)
</p> </p>
@ -65,7 +69,8 @@ yhn
以示例1为例，从这个图中可以看出 abc 到 def的路线 不止一条，但最短的一条路径上是4个节点。 以示例1为例，从这个图中可以看出 abc 到 def的路线 不止一条，但最短的一条路径上是4个节点。
![](https://code-thinking-1253855093.file.myqcloud.com/pics/20240529121038.png) ![](https://code-thinking-1253855093.file.myqcloud.com/pics/20250317105155.png)
本题只需要求出最短路径的长度就可以了，不用找出具体路径。 本题只需要求出最短路径的长度就可以了，不用找出具体路径。