프로그래머스) Lv3 - 하노이의 탑

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

코딩테스트 연습 - 하노이의 탑

재귀를 이용해 구현하였습니다.

---

C++ 소스 코드

#include <vector>
#include <string>
using namespace std;
vector<vector<int>> answer;
void hanoi(int n, int from, int to, int tmp){
    vector<int> temp = { from, to };
    if (n == 1) answer.push_back(temp);
    else{
        hanoi(n-1, from, tmp, to);
        answer.push_back(temp);
        hanoi(n-1, tmp, to, from);
    }
}
vector<vector<int>> solution(int n){
    hanoi(n, 1, 3, 2);
    return answer;
}

---

Swift 소스 코드

import Foundation

func solution(_ n:Int) -> [[Int]] {
    var answer: [[Int]] = []
    
    func hanoi(n: Int, from: Int, to: Int, via: Int){
        let tmp: [Int] = [from, to]
        if n == 1 {
            answer.append(tmp)
        }else {
            hanoi(n: n-1,from: from, to: via, via: to)
            answer.append(tmp)
            hanoi(n: n-1, from: via, to: to, via: from)
        }
    }
    
    hanoi(n: n, from: 1, to: 3, via: 2)
    
    return answer
}