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

Revert "docs: 更正0459的文本的语句陈述。"

Browse Source 
This reverts commit 51f6ab5a54f7e6c3ee0518e2b1fd093b784d434a.
This commit is contained in:
poivre
2024-09-18 00:27:25 +08:00
parent 51f6ab5a54
commit ee41f4df22
1 changed files with 1 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -163,7 +163,7 @@ KMP算法中next数组为什么遇到字符不匹配的时候可以找到上一
如果一个字符串s是由重复子串组成，那么 最长相等前后缀不包含的子串一定是字符串s的最小重复子串。
证明： 如果s 是由最小重复子串p组成。
证明： 如果s 是有是有最小重复子串p组成。
即 s = n * p
@ -884,4 +884,3 @@ public int[] GetNext(string s)
<a href="https://programmercarl.com/other/kstar.html" target="_blank">
<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
</a>