하노이의 탑 (연습문제)

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

프로그래머스

 

풀이

import java.util.*;

class Solution {
    public static List<int[]> list;

    public int[][] solution(int n) {
        list = new ArrayList<>();

        fn(1, 2, 3, n);

        return list.toArray(new int[0][]);
    }

    public void fn(int start, int mid, int end, int cnt) {
        if (cnt == 1) {
            list.add(new int[]{start, end});
        } else {
            fn(start, end, mid, cnt - 1);
            fn(start, mid, end, 1);
            fn(mid, start, end, cnt - 1);
        }
    }
}