在此uint8数组中搜索模式的更优雅方法

def kmp_search(pattern, text):
    m = len(pattern)
    n = len(text)
    
    # 构建部分匹配表
    def build_partial_match_table(pattern):
        table = [0] * m
        i = 1
        j = 0
        while i < m:
            if pattern[i] == pattern[j]:
                j += 1
                table[i] = j
                i += 1
            else:
                if j > 0:
                    j = table[j - 1]
                else:
                    table[i] = 0
                    i += 1
        return table
    
    table = build_partial_match_table(pattern)
    
    # 执行匹配操作
    i = 0
    j = 0
    while i < n:
        if pattern[j] == text[i]:
            i += 1
            j += 1
            if j == m:
                return i - m  # 匹配成功，返回匹配的起始索引
        else:
            if j > 0:
                j = table[j - 1]
            else:
                i += 1
    
    return -1  # 匹配失败，返回-1

# 调用示例
text = [1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 6]
pattern = [1, 2, 3, 4, 5, 6]
result = kmp_search(pattern, text)
print(result)