Skip to content

Create Greatest Common Divisor of Strings - Leetcode 1071.py #4

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Create Greatest Common Divisor of Strings - Leetcode 1071.py #4

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 16 additions & 0 deletions Greatest Common Divisor of Strings - Leetcode 1071.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
class Solution:
def gcd(self, a, b):
if b == 0:
return a
return self.gcd(b, a % b)

def gcdOfStrings(self, str1, str2):
gcdString = ""

if str1 + str2 == str2 + str1:
return str1[0 : self.gcd(len(str1), len(str2))]

return gcdString

# Time Complexity: O(log(min(n, m))) -- n and m are the lengths of strings s and t respectively.
# Space Complexity: O(log(min(n, m))) -- depending on the number of recursive calls allocation on the stack.