Greatest Common Divisor of Strings

LeetCode題目: 1071. Greatest Common Divisor of Strings

My solution:

/**
 * @param {string} str1
 * @param {string} str2
 * @return {string}
 */
let gcdOfStrings = (str1, str2) => {
    if(str1 + str2 !== str2 + str1) return '';
    const searchGCD = (digitA, digitB) => (digitA % digitB === 0) ? digitB : searchGCD(digitB, digitA % digitB);
    const gcdDigit = searchGCD(str1.length, str2.length);
    return str1.substring(0, gcdDigit);
};
profile-image
Hi, 我是 Zeki。目前為一名前端工程師。我相信科技始終來自於人性,是用來幫助人們過上更有品質的生活的,但願也希望如此。