알고리즘/소스코드
PROGRAMMERS 12953: N개의 최소공배수
cjw.git
2021. 1. 6. 20:50
Link : programmers.co.kr/learn/courses/30/lessons/12953
Python
더보기
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
|
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
|
cs |
FeedBack
cjw.git@gmail.com