对kmp模式匹配还是不完全搞明白
func getNext(next []int, haystack string){
j := 0
next[0] := 0
for i := 1; i < len(haystack); i++{
for j > 0 && haystack[i] != haystack[j]{
j = haystack[j-1]
}
if haystack[i] == haystack[j]{
j++
}
next[i] = j
}
}
对kmp模式匹配还是不完全搞明白
func getNext(next []int, haystack string){
j := 0
next[0] := 0
for i := 1; i < len(haystack); i++{
for j > 0 && haystack[i] != haystack[j]{
j = haystack[j-1]
}
if haystack[i] == haystack[j]{
j++
}
next[i] = j
}
}