[LeetCode] 1071. Greatest Common Divisor of Strings ×Ö·û´®µÄ×î´ó¹«Òò×Ó

For two strings and , we say " divides " if and only if ( concatenated with itself 1 or more times) Given two strings str1 and str2, return the larges