1668. Maximum Repeating Substring-最大重复子字符串

For a string sequence, a string word is k-repeating if word concatenated k times is a substring of sequence. The word’s maximum k-repeating value is the highest value k where word is k-repeating in sequence. If word is not a substring of sequence, word’s maximum k-repeating value is 0.

Given strings sequence and word, return the maximum k-repeating value of word in sequence.

Example 1:
Input: sequence = "ababc", word = "ab"
Output: 2
Explanation: "abab" is a substring in "ababc".

Example 2:
Input: sequence = "ababc", word = "ba"
Output: 1
Explanation: "ba" is a substring in "ababc". "baba" is not a substring in "ababc".

Example 3:
Input: sequence = "ababc", word = "ac"
Output: 0
Explanation: "ac" is not a substring in "ababc".

Constraints:
-1 <= sequence.length <= 100

• 1 <= word.length <= 100
• sequence and word contains only lowercase English letters.

Solution in python:

class Solution:
    def maxRepeating(self, sequence: str, word: str) -> int:
        j = 0
        count = 0
        max_c = 0
        length = len(word)
        while j < len(sequence)-length+1:
            i = j
            while sequence[i:i+length] == word:
                count += 1
                if count > max_c:
                    max_c = count
                i += length
            else:
                count = 0
                j += 1
        return max_c