github/leetcode-master
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update

Browse Source
This commit is contained in:
programmercarl
2024-10-09 16:59:26 +08:00
parent ba2062471b aab47d3a3d
commit dbc93eb196
21 changed files with 753 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
problems/0459.重复的子字符串.md
View File

@@ -177,7 +177,7 @@ KMP算法中next数组为什么遇到字符不匹配的时候可以找到上一
![](https://code-thinking-1253855093.file.myqcloud.com/pics/20240913110841.png)
这里有录友就想：如果字符串s 是有是有最小重复子串p组成，最长相等前后缀就不能更长一些？ 例如这样：
这里有录友就想：如果字符串s 是由最小重复子串p组成，最长相等前后缀就不能更长一些？ 例如这样：
![](https://code-thinking-1253855093.file.myqcloud.com/pics/20240913114348.png)
@@ -884,3 +884,4 @@ public int[] GetNext(string s)
<a href="https://programmercarl.com/other/kstar.html" target="_blank">
<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
</a>