PROGRAMMERS 12953: N개의 최소공배수

Link : programmers.co.kr/learn/courses/30/lessons/12953

---

Python

def solution(arr):
    arr.sort()
    stack = []
    max_value = arr[-1]
    while True:
        status = False
        for i in range(2,max_value + 1):
            for item in range(len(arr)):
                if arr[item] % i == 0:
                    arr[item] //= i
                    status = True
            if status:
                stack.append(i)
                break
        if not status:
            break
 
    total = 1
    for i in stack:
        total *= i
    return total

FeedBack

1.  

---

 

 

 

cjw.git@gmail.com