題目如下：

For a stringsequence, a stringwordisk-repeatingifwordconcatenatedktimes is a substring ofsequence. Theword'smaximumk-repeating valueis the highest valuekwherewordisk-repeating insequence. Ifwordis not a substring ofsequence,word's maximumk-repeating value is0.

Given stringssequenceandword, returnthemaximumk

-repeating valueofwordinsequence.

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
• sequenceandwordcontains only lowercase English letters.

解題思路：送分題。

程式碼如下：

class Solution(object):
    def maxRepeating(self, sequence, word):
        """
        :type sequence: str
        :type word: str
        :rtype: int
        
 
"""
        n = len(sequence) / len(word)
        while n > 0:
            if word * n in sequence:
                return n
            n -= 1
        return 0