LeetCode 1668. Maximum Repeating Substring
来源：哔哩哔哩
2023-05-11 09:12:04
For a string sequence, a string wordis k-repeating if wordconcatenated ktimes is a substring of sequence. The word's maximum k-repeating value is the highest value kwhere wordis k-repeating in sequence. If wordis not a substring of sequence, word's maximum k-repeating value is 0.
(资料图片仅供参考)
Given strings sequenceand word, return the maximum k-repeating value of wordin 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
sequenceand wordcontains only lowercase English letters.
easy题目，依次遍历即可；
下面是代码：
Runtime: 0 ms, faster than 100.00% of Java online submissions for Maximum Repeating Substring.
Memory Usage: 40.9 MB, less than 50.11% of Java online submissions for Maximum Repeating Substring.
