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

Update 0127.单词接龙.md

Browse Source 
fix typo
This commit is contained in:
Guan-t7
2022-10-20 23:08:04 +08:00
committed by GitHub
parent 75c9c4975f
commit 5dcdb06e64
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0127.单词接龙.md
View File

@ -31,7 +31,7 @@
# 思路
以示例1为例，从这个图中可以看出 hit 到 cog的路线，不止一条，有三条，两条是最短的长度为5，一条长度为6。
以示例1为例，从这个图中可以看出 hit 到 cog的路线，不止一条，有三条，一条是最短的长度为5，两条长度为6。
![](https://code-thinking-1253855093.file.myqcloud.com/pics/20210827175432.png)