题解 | #汉诺塔问题#

import java.util.*;

public class Solution {
    
     ArrayList<String> arrayList = new ArrayList<String>();
    
	 public ArrayList<String> getSolution(int n) {
	        // write code here
		 arrayList = hanNuoTa(n, "left", "mid", "right");
		 
		 return arrayList;
	    }
	 
	 public ArrayList<String> hanNuoTa(int num,String left,String mid,String right) { 
		 
			if(num==1) {
                //如果一个盘从左到右
				arrayList.add("move "+"from "+left+" to "+right);
			}else {
				//前面的从左挪到中间
				hanNuoTa(num-1, left, right, mid);
				
				arrayList.add("move "+"from "+left+" to "+right);
				//从中间移到右边
				hanNuoTa(num-1, mid, left, right);
			}
			return arrayList;
		}
}