Golang | Leetcode Golang题解之第459题重复的子字符串
题目：
题解：
func repeatedSubstringPattern(s string) bool {
return kmp(s + s, s)
}
func kmp(query, pattern string) bool {
n, m := len(query), len(pattern)
fail := make([]int, m)
for i := 0; i < m; i++ {
fail[i] = -1
}
for i := 1; i < m; i++ {
j := fail[i - 1]
for j != -1 && pattern[j + 1] != pattern[i] {
j = fail[j]
}
if pattern[j + 1] == pattern[i] {
fail[i] = j + 1
}
}
match := -1
for i := 1; i < n - 1; i++ {
for match != -1 && pattern[match + 1] != query[i] {
match = fail[match]
}
if pattern[match + 1] == query[i] {
match++
if match == m - 1 {
return true
}
}
}
return false
}原文地址：https://blog.csdn.net/weixin_66442839/article/details/142722134
免责声明：本站文章内容转载自网络资源，如本站内容侵犯了原著者的合法权益，可联系本站删除。更多内容请关注自学内容网（zxcms.com）！