汉诺塔问题实现

class Solution{
 public void hanota(List<Integer> A, List<Integer> B, List<Integer> C) {
process(A.size(),A,C,B);
}
   //from to other
    public void process(Integer N,List<Integer> from,List<Integer> to,List<Integer> other){
        if(N==1){//只移动一个盘子直接移动就好
             to.add(from.get(from.size()-1));
             from.remove(from.size()-1);
        }else{
        process(N-1,from,other,to);//N-1个从左边移到中间
        to.add(from.get(from.size()-1));
        from.remove(from.size()-1);
        process(N-1,other,to,from);//N-1个从中间移到右边
        }
    }
}