递归

斐波那契数列问题

Posted by Ruizhi Ma on June 18, 2019

TestFeobnacci类

package demo3;

public class TestFebonacci {
	//斐波那契数列: 1 1 2 3 5 8 13 ...
	
	public static int febonacci(int i){
		//出口条件
		if(i == 1 || i == 2){
			return 1;
		}else{
            //递归公式
			return febonacci(i - 1) + febonacci(i - 2);
		}
	}
	
	public static void main(String[] args){
		int i = febonacci(7);
		System.out.println(i);
	}
}

运行结果:
13