力扣每日一题 最大重复子字符串

Day 36

Date: November 3, 2022 12:49 PM
LinkedIn: https://leetcode.cn/problems/maximum-repeating-substring/description/
Title: 最大重复子字符串

不可以直接return sequence.count(word)
因为要计算连续的重复的字符串构成的子字符串

class Solution:
    def maxRepeating(self, sequence: str, word: str) -> int:
        n1 = len(sequence) # 字符串长度
        n2 = len(word) # 重复字符串长度 
        n = floor(n1 / n2) # 最多包含重复字符串数量
        for i in range(n, -1, -1): # 倒序
            if word * i in sequence: # 找最长子字符串
                return i