[Level 1] / [Python] 최대공약수와 최소공배수

https://school.programmers.co.kr/learn/courses/30/lessons/12940

프로그래머스

---

옛날의 나

def solution(n, m):
    answer = []

    a = 0
    b = 0

    for i in range(1,n+1):
        if n%i == 0 and m%i == 0:
            a = i

    answer.append(a)

    if answer[0] == 0:
        answer.append(n*m)
    else:
        answer.append(answer[0]*(n//answer[0])*(m//answer[0]))           

    return answer

지금

def solution3(a, b):
    a_, b_ = max(a, b), min(a, b)
    while b_ != 0:
        a_, b_ = b_, a_ % b_
    answer = [a_, int(a*b/a_)]