1son

문제 : 코드 : class Solution: def gcdOfStrings(self, str1: str, str2: str) -> str: if str1 + str2 != str2 + str1: return "" length = math.gcd(len(str1),len(str2)) return str1[:length] 참고 블로그 : https://velog.io/@insutance/Python-set-%EC%9D%B4%EB%9E%80 [Python] set() 이란 python 'set( ) 함수' 정리 velog.io https://ryong9rrr.github.io/leetcode1071-Greatest-Common-Divisor-of-Strings/ Leetcode 1071 (Easy) : Gr..

문제 : 해답 : class Solution: def mergeAlternately(self, word1: str, word2: str) -> str: length1=len(word1) length2=len(word2) i=0 j=0 res="" while i+j

문제 : 해답 : class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: output =[] for i in range(len(nums)): i_val = nums[i] for j in range(1,len(nums)): j_val = nums[j] if i==j: break if i_val + j_val == target: output.append(i) output.append(j) return output