简单算法--递归

public class Recursion {

 public static void main(String[] args) {
  hanoTower(4,"A","B","C");

 }
 //斐波那契数列
 public static int fibonacci(int n){
  if(n<=2){
   return 1;
  }
  return fibonacci(n-1)+fibonacci(n-2);
 }
 //汉诺塔问题
 public static void hanoTower(int n,String  towerA,String towerB ,String towerC){
  if(n>0){
   hanoTower(n-1,towerA,towerC,towerB);
   move(n,towerA,towerB);
   hanoTower(n-1,towerC,towerB,towerA);
  }
 }
 public static void move(int n,String towerA ,String towerB){
  System.out.println("move"+" "+n+towerA+"-----"+towerB);
 }
}