Package g1001_1100.s1071_greatest_common_divisor_of_strings

Class Solution

java.lang.Object

g1001_1100.s1071_greatest_common_divisor_of_strings.Solution

public class Solution
extends Object

1071 - Greatest Common Divisor of Strings.<p>Easy</p> <p>For two strings <code>s</code> and <code>t</code>, we say &ldquo;<code>t</code> divides <code>s</code>&rdquo; 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><strong>Example 1:</strong></p> <p><strong>Input:</strong> str1 = &ldquo;ABCABC&rdquo;, str2 = &ldquo;ABC&rdquo;</p> <p><strong>Output:</strong> &ldquo;ABC&rdquo;</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> str1 = &ldquo;ABABAB&rdquo;, str2 = &ldquo;ABAB&rdquo;</p> <p><strong>Output:</strong> &ldquo;AB&rdquo;</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> str1 = &ldquo;LEET&rdquo;, str2 = &ldquo;CODE&rdquo;</p> <p><strong>Output:</strong> &quot;&quot;</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>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
String	gcdOfStrings(String str1, String str2)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

gcdOfStrings

public String gcdOfStrings(String str1,
 String str2)