题解 | #汉诺塔问题#

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param n int整型
     * @return string字符串ArrayList
     */
    ArrayList<String> list = new ArrayList<>();
    public ArrayList<String> getSolution (int n) {
        // write code here
        hanno(n, "left", "mid", "right");
        return list;
    }

    private void hanno(int n, String left, String mid, String right) {
        // TODO
        if (n == 0) return;
        hanno(n - 1, left, right, mid);
        list.add(String.format("move from %s to %s", left, right));
        hanno(n - 1, mid, left, right);

    }


}