从字符串中搜索子字符串的多次出现

def kmp_search(text, pattern):
    # 构建next数组
    next = [0] * len(pattern)
    i, j = 1, 0
    while i < len(pattern):
        if pattern[i] == pattern[j]:
            j += 1
            next[i] = j
            i += 1
        elif j > 0:
            j = next[j-1]
        else:
            next[i] = 0
            i += 1
    
    # 使用next数组进行匹配
    matches = []
    i, j = 0, 0
    while i < len(text):
        if text[i] == pattern[j]:
            i += 1
            j += 1
            if j == len(pattern):
                matches.append(i - j)
                j = next[j-1]
        elif j > 0:
            j = next[j-1]
        else:
            i += 1
    
    return matches

def search_all_occurrences(text, pattern):
    occurrences = []
    matches = kmp_search(text, pattern)
    while matches:
        occurrences.extend(matches)
        text = text[matches[-1]+1:]
        matches = kmp_search(text, pattern)
    
    return occurrences

# 示例用法
text = "abababab"
pattern = "aba"
occurrences = search_all_occurrences(text, pattern)
print(occurrences)  # 输出 [0, 2, 4]