mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
34 lines
1.2 KiB
HTML
34 lines
1.2 KiB
HTML
<p>For two strings <code>s</code> and <code>t</code>, we say "<code>t</code> divides <code>s</code>" if and only if <code>s = t + ... + t</code> (i.e., <code>t</code> is concatenated with itself one or more times).</p>
|
|
|
|
<p>Given two strings <code>str1</code> and <code>str2</code>, return <em>the largest string </em><code>x</code><em> such that </em><code>x</code><em> divides both </em><code>str1</code><em> and </em><code>str2</code>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> str1 = "ABCABC", str2 = "ABC"
|
|
<strong>Output:</strong> "ABC"
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> str1 = "ABABAB", str2 = "ABAB"
|
|
<strong>Output:</strong> "AB"
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> str1 = "LEET", str2 = "CODE"
|
|
<strong>Output:</strong> ""
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= str1.length, str2.length <= 1000</code></li>
|
|
<li><code>str1</code> and <code>str2</code> consist of English uppercase letters.</li>
|
|
</ul>
|