내가 보려고 저장

나의 답 : def solution(arr1, arr2): #arr1 * arr2가 안 되고, #arr2 * arr1가 될 수도 있기 때문에 확인 후 바꾼다. if len(arr1[0]) != len(arr2): arr1,arr2 = arr2, arr1 x=len(arr1) y=len(arr2) z=len(arr2[0]) # x*y 행렬과 y*z 행렬의 곱 => x*z 행렬 #x*z의 빈 행렬 만들기 answer = [] for i in range(x): temp=[] for j in range(z): temp.append(0) answer.append(temp) #값 넣기 for i in range(x): for j in range(y): for k in range(z): answer[i][k]+=ar..

나의 답 : from math import gcd def lcm(x,y): return x*y // gcd(x,y) def solution(arr): answer = arr[0] for i in range(1,len(arr)): answer = lcm(answer,arr[i]) return answer x와 y의 최소공배수 : x * y // (x와 y의 최대공약수)

나의 답 : def solution(s): l=s.split(' ') answer = [] for i in l: i=i.capitalize() answer.append(i) return ' '.join(answer) 다른 사람의 답 : def Jaden_Case(s): return s.title() title() ㅋㅋ

나의 답 : def solution(lottos, win_nums): minlotto=7 maxlotto=6 for i in lottos: if i in win_nums: minlotto-=1 maxlotto=minlotto-lottos.count(0) if minlotto==7: minlotto=6 if maxlotto==7: maxlotto=6 return [maxlotto,minlotto] 다른 사람의 답 : def solution(lottos, win_nums): rank=[6,6,5,4,3,2,1] cnt_0 = lottos.count(0) ans = 0 for x in win_nums: if x in lottos: ans += 1 return rank[cnt_0 + ans],rank[ans]

나의 답 : def solution(nums): answer = 0 l = len(nums) for i in range(0,l-2): for j in range(i+1,l-1): for k in range(j+1,l): sum=nums[i]+nums[j]+nums[k] print(sum) flag=True for w in range(2,sum): if(sum%w==0): flag=False break if(flag==True): answer+=1 return answer 다른 사람의 답 : def solution(nums): from itertools import combinations as cb answer = 0 for a in cb(nums, 3): cand = sum(a) for j in rang..

나의 답 : def solution(new_id): new_id = new_id.lower() for i in new_id: if i in '~!@#$%^&*()=+[{]}:?,/': new_id = new_id.replace(i,'') while('..' in new_id): new_id = new_id.replace('..','.') l=len(new_id) if(l>0): if(new_id[0]=='.'): new_id=new_id[1:] l=len(new_id) if(l>0): if(new_id[l-1]=='.'): new_id=new_id[:-1] if(len(new_id) == 0): new_id='a' if(len(new_id)>=16): new_id = new_id[:15] if(new_i..

나의 답 : def solution(numbers): return 45-sum(numbers) 쉬웠지만 그냥 올림

나의 답 : def solution(left, right): answer = 0 for i in range(left, right+1): tmp=0 for j in range(1,i+1): if i%j==0: tmp+=1 if tmp%2==0: answer+=i else: answer-=i return answer 다른 사람의 답: def solution(left, right): answer = 0 for i in range(left,right+1): if int(i**0.5)==i**0.5: answer -= i else: answer += i return answer

내답: def solution(nums): l= len(nums)/2 a= set() for i in nums: a.add(i) al=len(a) if al>l: return l else: return al 다른사람답: def solution(ls): return min(len(ls)/2, len(set(ls))) 리스트에 set함수를 사용하면 바로 set으로 변하는구나.

나의 답 : def solution(sizes): max_w=0 max_h=0 for i in sizes: if i[0]