[프로그래머스][Python] 최대공약수와 최소공배수

def solution(n,m):
    n_divisor=set()
    m_divisor=set()
    for i in range(1,n+1):
        if n % i==0:
            n_divisor.add(i)
    for j in range(1,m+1):
        if m % j==0:
            m_divisor.add(j)
    max_divisor = max(n_divisor.intersection(m_divisor))
    n_num = n/ max_divisor
    m_num = m / max_divisor
    min_divisor = max_divisor * n_num *m_num
    return [max_divisor,min_divisor]