maximum-repeating-substring

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

For a string <code>sequence</code>, a string <code>word</code> is <code>k</code>-repeating if <code>word</code> concatenated <code>k</code> times is a substring of <code>sequence</code>. The <code>word</code>&#39;s maximum <code>k</code>-repeating value 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>&#39;s maximum <code>k</code>-repeating value is <code>0</code>.

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

&nbsp;
Example 1:

<pre>
Input: sequence = &quot;ababc&quot;, word = &quot;ab&quot;
Output: 2
Explanation: &quot;abab&quot; is a substring in &quot;ababc&quot;.
</pre>

Example 2:

<pre>
Input: sequence = &quot;ababc&quot;, word = &quot;ba&quot;
Output: 1
Explanation: &quot;ba&quot; is a substring in &quot;ababc&quot;. &quot;baba&quot; is not a substring in &quot;ababc&quot;.
</pre>

Example 3:

<pre>
Input: sequence = &quot;ababc&quot;, word = &quot;ac&quot;
Output: 0
Explanation: &quot;ac&quot; is not a substring in &quot;ababc&quot;. 
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= sequence.length &lt;= 100</code></li>
	<li><code>1 &lt;= word.length &lt;= 100</code></li>
	<li><code>sequence</code> and <code>word</code>&nbsp;contains only lowercase English letters.</li>
</ul>

maxRepeating

Maximum Repeating Substring

Detect Pattern of Length M Repeated K or More Times

detect-pattern-of-length-m-repeated-k-or-more-times

重复至少 K 次且长度为 M 的模式

Minimum Number of Operations to Make Word K-Periodic

minimum-number-of-operations-to-make-word-k-periodic

K 周期字符串需要的最少操作次数

String

Dynamic Programming

String Matching

给你一个字符串 <code>sequence</code> ，如果字符串 <code>word</code> 连续重复 <code>k</code> 次形成的字符串是 <code>sequence</code> 的一个子字符串，那么单词 <code>word</code> 的 重复值为 <code>k</code> 。单词 <code>word</code> 的 最大重复值 是单词 <code>word</code> 在 <code>sequence</code> 中最大的重复值。如果 <code>word</code> 不是 <code>sequence</code> 的子串，那么重复值 <code>k</code> 为 <code>0</code> 。

给你一个字符串 <code>sequence</code> 和 <code>word</code> ，请你返回 最大重复值 <code>k</code> 。

 

示例 1：

<pre>
输入：sequence = "ababc", word = "ab"
输出：2
解释："abab" 是 "ababc" 的子字符串。
</pre>

示例 2：

<pre>
输入：sequence = "ababc", word = "ba"
输出：1
解释："ba" 是 "ababc" 的子字符串，但 "baba" 不是 "ababc" 的子字符串。
</pre>

示例 3：

<pre>
输入：sequence = "ababc", word = "ac"
输出：0
解释："ac" 不是 "ababc" 的子字符串。
</pre>

 

提示：

<ul>
	<li><code>1 <= sequence.length <= 100</code></li>
	<li><code>1 <= word.length <= 100</code></li>
	<li><code>sequence</code> 和 <code>word</code> 都只包含小写英文字母。</li>
</ul>