字符串在另一个字符串中的最大连续出现次数

当我们处理字符串相关的问题时，常常需要寻找一个字符串在另一个给定字符串中的连续出现次数。下面是一个演示程序：

def max_consecutive_occurrences(s, t):
    if not s or not t:
        return 0
    
    m, n = len(s), len(t)
    i, j, cnt = 0, 0, 0
    
    while i < m:
        if s[i] == t[j]:
            j += 1
            if j == n:
                cnt += 1
                j = 0
        else:
            j = 0
        i += 1
    
    return cnt

这个函数的输入参数是两个字符串 s 和 t。函数的返回值是一个整数，表示 t 在 s 中的最大连续出现次数。我们可以通过一些测试用例来验证这个函数的正确性：

assert max_consecutive_occurrences("", "") == 0
assert max_consecutive_occurrences("ABCD", "") == 0
assert max_consecutive_occurrences("", "ABCD") == 0
assert max_consecutive_occurrences("ABCD", "B") == 1
assert max_consecutive_occurrences("ABCD", "AB") == 1
assert max_consecutive_occurrences("AABABBCDDDE", "A") == 2
assert max_consecutive_occurrences("AABABBCDDDE", "AB") == 1
assert max_consecutive_occurrences("AABABBCDDDE", "D") == 3
assert max_consecutive_occurrences("AABABBCDDDE", "DE") == 1
assert max_consecutive_occurrences("AABABBCDDDE", "AA") == 1
assert max_consecutive_occurrences("AABABBCDDDE", "EE") == 0

以上就是一个简单的寻找字符串在另一个字符串中的最大连续出现次数的实现。该算法的时间复杂度是 $O(n)$，其中 $n$ 是字符串 s 的长度。