Package g1001_1100.s1071_greatest_common_divisor_of_strings

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1071 - Greatest Common Divisor of Strings\.

    Easy

    For two strings s and t, we say "t divides s" if and only if s = t + ... + t (i.e., t is concatenated with itself one or more times).

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

    Example 1:

    Input: str1 = "ABCABC", str2 = "ABC"

    Output: "ABC"

    Example 2:

    Input: str1 = "ABABAB", str2 = "ABAB"

    Output: "AB"

    Example 3:

    Input: str1 = "LEET", str2 = "CODE"

    Output: ""

    Constraints:

    • 1 <= str1.length, str2.length <= 1000

    • str1 and str2 consist of English uppercase letters.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

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

      • Methods inherited from class java.lang.Object

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