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.

不断进行查找即可。

class MaximumRepeatingSubstring : public Solution {
public:
    void Exec() {

    }
    int maxRepeating(string sequence, string word) {
        int repeat = 0;
        string sub = word;
        size_t pos = sequence.find(sub);
        while (pos != string::npos) {
            ++repeat;
            sub += word;
            pos = sequence.find(sub);
        }
        return repeat;
    }
};