[Programmers] 하노이의 탑(Python, Javascript)

문제

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

프로그래머스

---

풀이

Python

def solution(n):
    answer = []
    
    def hanoi(k, fr, to, ot):
        nonlocal answer
        
        if k == 1:
            answer.append([fr, to])
            return
            
        hanoi(k-1, fr, ot, to)
        answer.append([fr, to])
        hanoi(k-1, ot, to, fr)
        
    hanoi(n, 1, 3, 2)
        
    return answer

 

Javascript

let answer;
function hanoi(k, fr, to, ot){
    if (k == 1){
        answer.push([fr, to]);
        return;
    }

    hanoi(k-1, fr, ot, to);
    answer.push([fr, to]);
    hanoi(k-1, ot, to, fr);
}

function solution(n) {
    answer = [];
    
    hanoi(n, 1, 3, 2);
    return answer;
}