GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — leetcode/1071.Greatest Common Divisor of Strings at master · geemo/leetcode

Expand file tree

/

1071.Greatest Common Divisor of Strings

/
Copy path

Directory actions

More options

More options

Directory actions

More options

More options

Latest commit

 

History

History
History
/

1071.Greatest Common Divisor of Strings

/
Copy path

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
README.md
README.md
 
 

README.md

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.

Solution:

func gcdOfStrings(str1 string, str2 string) string {
  if str1 + str2 != str2 + str1 {
    return ""
  }

  return str1[:gcd(len(str1), len(str2))]
}

func gcd(a, b int) int {
  if b == 0 {
    return a
  }
  return gcd(b, a % b)
}
You are visitor 01402605 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.