Movatterモバイル変換


[0]ホーム

URL:


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

Commit65aa1c0

Browse files
joaquingxjakobkogler
authored andcommitted
Fixing Typo (#244)
1 parent9174567 commit65aa1c0

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎src/string/prefix-function.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -132,7 +132,7 @@ We generate the string $s + \\# + t$, where $\\#$ is a separator that appear in
132132
Let us calculate the prefix function for this string.
133133
Now think about the meaning of the values of the prefix function, except for the first $n + 1$ entries (which belong to the string $s$ and the separator).
134134
By definition the value $\pi[i]$ shows the longest length of a substring ending in position $i$ that coincides with the prefix.
135-
But in our case this isisnothing more than the largest block that coincides with $s$ and ends at position $i$.
135+
But in our case this is nothing more than the largest block that coincides with $s$ and ends at position $i$.
136136
This length cannot be bigger than $n$ due to the separator.
137137
But if equality $\pi[i] = n$ is achieved, then it means that the string $s$ appears completely in at this position, i.e. it ends at position $i$.
138138
Just do not forget that the positions are indexed in the string $s +\\# + t$.

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp