lc1071. Greatest Common Divisor of Strings

1071. Greatest Common Divisor of Strings Easy

62

25

Favorite

Share For strings S and T, we say "T divides S" if and only if S = T + ... + T (T concatenated with itself 1 or more times)

Return the largest string X such that X divides str1 and X divides 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: ""

Note:

1 <= str1.length <= 1000 1 <= str2.length <= 1000 str1[i] and str2[i] are English uppercase letters.

思路：替换字符串

代码：python3

class Solution:
    def gcdOfStrings(self, str1: str, str2: str) -> str:

        while True:
            if str1 in str2:
                str2 = str2.replace(str1,"")
            elif str2 in str1:
                str1 = str1.replace(str2,"")
            else:
                return ""
            if str2=="":
                return str1
            if str1=="":
                return str2
复制代码

转载于:https://juejin.im/post/5d07318ff265da1baa1e73e1