28. 实现 strStr()

算法-目录

28. 实现 strStr()

KMP

class Solution(object):
    def strStr(self, haystack, needle):
        """
        :type haystack: str
        :type needle: str
        :rtype: int
        """
        sn = len(haystack)
        tn = len(needle)

        next = self.get_next(needle)
        i = 0
        j = 0
        while i < sn and j < tn:
            if j == -1 or haystack[i] == needle[j]:
                i += 1
                j += 1
            else:
                j = next[j]
        if j == tn:
            return i - tn
        return -1
    
    def get_next(self, t):
        n = len(t)
        next = [0 for _ in range(n + 1)]
        next[0] = -1
        l = -1
        r = 0
        while r < n:
            if l == -1 or t[l] == t[r]:
                l += 1
                r += 1
                next[r] = l
            else:
                l = next[l]
        return next

调函数

class Solution(object):
    def strStr(self, haystack, needle):
        """
        :type haystack: str
        :type needle: str
        :rtype: int
        """
        return haystack.find(needle)