greatest-common-divisor-of-strings

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 two strings <code>s</code> and <code>t</code>, we say &quot;<code>t</code> divides <code>s</code>&quot; if and only if <code>s = t + t + t + ... + t + t</code> (i.e., <code>t</code> is concatenated with itself one or more times).

Given two strings <code>str1</code> and <code>str2</code>, return the largest string <code>x</code> such that <code>x</code> divides both <code>str1</code> and <code>str2</code>.

&nbsp;
Example 1:

<pre>
Input: str1 = &quot;ABCABC&quot;, str2 = &quot;ABC&quot;
Output: &quot;ABC&quot;
</pre>

Example 2:

<pre>
Input: str1 = &quot;ABABAB&quot;, str2 = &quot;ABAB&quot;
Output: &quot;AB&quot;
</pre>

Example 3:

<pre>
Input: str1 = &quot;LEET&quot;, str2 = &quot;CODE&quot;
Output: &quot;&quot;
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= str1.length, str2.length &lt;= 1000</code></li>
	<li><code>str1</code> and <code>str2</code> consist of English uppercase letters.</li>
</ul>

gcdOfStrings

Greatest Common Divisor of Strings

Find Greatest Common Divisor of Array

find-greatest-common-divisor-of-array

找出数组的最大公约数

Smallest Even Multiple

smallest-even-multiple

最小偶倍数

Find the Maximum Factor Score of Array

find-the-maximum-factor-score-of-array

数组的最大因子得分

Math

String

对于字符串&nbsp;<code>s</code> 和&nbsp;<code>t</code>，只有在&nbsp;<code>s = t + t + t + ... + t + t</code>（<code>t</code> 自身连接 1 次或多次）时，我们才认定&nbsp;“<code>t</code> 能除尽 <code>s</code>”。

给定两个字符串&nbsp;<code>str1</code>&nbsp;和&nbsp;<code>str2</code>&nbsp;。返回 最长字符串&nbsp;<code>x</code>，要求满足&nbsp;<code>x</code> 能除尽 <code>str1</code> 且 <code>x</code> 能除尽 <code>str2</code> 。

&nbsp;

示例 1：

<pre>
输入：str1 = "ABCABC", str2 = "ABC"
输出："ABC"
</pre>

示例 2：

<pre>
输入：str1 = "ABABAB", str2 = "ABAB"
输出："AB"
</pre>

示例 3：

<pre>
输入：str1 = "LEET", str2 = "CODE"
输出：""
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= str1.length, str2.length &lt;= 1000</code></li>
	<li><code>str1</code>&nbsp;和&nbsp;<code>str2</code>&nbsp;由大写英文字母组成</li>
</ul>