KMP python 实现

最新推荐文章于 2025-03-10 21:45:55 发布

原创最新推荐文章于 2025-03-10 21:45:55 发布 · 262 阅读

0 ·

CC 4.0 BY-SA版权

本文深入探讨了KMP算法的原理与应用，通过详细的步骤解释了如何使用KMP算法进行字符串匹配。从预处理阶段的next数组计算到匹配过程的优化，全面解析KMP算法的高效性。

class Solution:
    def cal_next(self, str, next):
        k = -1
        for i in range(1, len(next)):
            while k > 0 and str[k + 1] != str[i]:
                k = next[k]
            if str[k + 1] == str[i]:
                k += 1
            next[i] = k


    def KMP(self, str, pstr, next):
        i, j = 0, 0
        self.cal_next(pstr, next)
        for i in range(len(str)):
            while j > 0 and pstr[j] != str[i]:
                j = next[j - 1]  + 1
            if pstr[j] == str[i]:
                j += 1
            if j == len(pstr):
                return i - len(pstr) + 1
        return -1

if __name__ == "__main__":
    test = Solution()
    str = 'bacbababadababacambabacaddababacasdsd'
    pstr = 'ababaca'
    next = [-1] * len(pstr)
    rlt = test.KMP(str, pstr, next)
    print(rlt)