[파이썬] 배열에서 최소공배수 구하기

def solution(arr):

    from math import gcd                            

    answer = arr[0]                                 

 

    for num in arr:                                 

        answer = answer*num // gcd(answer, num)     

 

    return answer

 

print(solution([2,6,8,14]))    168

print(solution([1,2,3]))        6