[Swift 알고리즘] 최대공약수와 최소공배수

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

func solution(_ n:Int, _ m:Int) -> [Int] {
    
    func gcd(_ a: Int, _ b: Int) -> Int {
        if b == 0 {
            return a
        } else {
            return gcd(b, a%b)
        }
    }
    
    func lcm(_ a: Int, _ b:Int) -> Int {
        return a * b / gcd(a, b)
    }

    let anwer = [gcd(n, m), lcm(n,m)]
    
    return anwer
}