mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
38 lines
1.8 KiB
HTML
38 lines
1.8 KiB
HTML
<p>For a string <code>sequence</code>, a string <code>word</code> is <strong><code>k</code>-repeating</strong> if <code>word</code> concatenated <code>k</code> times is a substring of <code>sequence</code>. The <code>word</code>'s <strong>maximum <code>k</code>-repeating value</strong> is the highest value <code>k</code> where <code>word</code> is <code>k</code>-repeating in <code>sequence</code>. If <code>word</code> is not a substring of <code>sequence</code>, <code>word</code>'s maximum <code>k</code>-repeating value is <code>0</code>.</p>
|
|
|
|
<p>Given strings <code>sequence</code> and <code>word</code>, return <em>the <strong>maximum <code>k</code>-repeating value</strong> of <code>word</code> in <code>sequence</code></em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> sequence = "ababc", word = "ab"
|
|
<strong>Output:</strong> 2
|
|
<strong>Explanation: </strong>"abab" is a substring in "<u>abab</u>c".
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> sequence = "ababc", word = "ba"
|
|
<strong>Output:</strong> 1
|
|
<strong>Explanation: </strong>"ba" is a substring in "a<u>ba</u>bc". "baba" is not a substring in "ababc".
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> sequence = "ababc", word = "ac"
|
|
<strong>Output:</strong> 0
|
|
<strong>Explanation: </strong>"ac" is not a substring in "ababc".
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= sequence.length <= 100</code></li>
|
|
<li><code>1 <= word.length <= 100</code></li>
|
|
<li><code>sequence</code> and <code>word</code> contains only lowercase English letters.</li>
|
|
</ul>
|