Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit ee41f4d

Browse files
Revert "docs: 更正0459的文本的语句陈述。"
This reverts commit 51f6ab5.
1 parent 51f6ab5 commit ee41f4d

File tree

1 file changed

+1
-2
lines changed

1 file changed

+1
-2
lines changed

‎problems/0459.重复的子字符串.md

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

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /