数据结构与算法-递归

递归

 有结束条件

方法调用自己本身

 

eq：波非那切数列

package math;

public class bfnq {

	public static void main(String[] args) {
		System.out.println(new bfnq().bfnq(7));
	}
	
	
	public int bfnq(int index){
	 
		 
		if(index<=2){
			 return 1 ;
		}
		
		return  bfnq(index-1)+bfnq(index-2);
		
		
		
	}
	

}

汉诺塔问题

package math;

public class hannuota {

	public static void main(String[] args) {
		hannuota h =  new hannuota();
		
		h.hannuota(3, "A", "B", "C");
		 System.out.println(h.num);

	}
	
	
	
	
	
	
	 
	int num = 0 ;
	
	public void hannuota(int number , String from ,String middle ,String to ){
		 
		if(number==1){
			System.out.println("把"+number+"盘从"+from+"移到"+to);
			num++;
		}else{
		
		hannuota(number-1,from,  to ,middle);
		System.out.println("把"+number+"盘从"+from+"移到"+to);
		num++;
		hannuota(number-1,middle,from,to);
		
		}
		
		
		
		
		
	}
	
	
	
	
	

}