查找子串在字符串中连续出现的最大次数

def build_partial_match_table(pattern):
    table = [0] * len(pattern)
    j = 0
    for i in range(1, len(pattern)):
        while j > 0 and pattern[i] != pattern[j]:
            j = table[j - 1]
        if pattern[i] == pattern[j]:
            j += 1
        table[i] = j
    return table

def kmp_search(text, pattern):
    table = build_partial_match_table(pattern)
    max_count = 0
    count = 0
    j = 0
    for i in range(len(text)):
        while j > 0 and text[i] != pattern[j]:
            j = table[j - 1]
        if text[i] == pattern[j]:
            j += 1
        if j == len(pattern):
            count += 1
            max_count = max(max_count, count)
            j = table[j - 1]
        else:
            count = 0
    return max_count

# 示例
text = "ababababab"
pattern = "abab"
print(kmp_search(text, pattern))  # 输出: 2