java data structures - Recursive algorithms - Fibonacci algorithm

package com.digui;

/**
* @auther 付强
* @date 2020/2/14 - 14:22
*/
//斐波那契实现
public class TestFebonacci {
public static void main(String[] args) {
int i=febnacci(10);
System.out.println(i);
//斐波那契数列:1 1 2 3 5 8
}
public static int febnacci(int i){
if(i==1||i==2){
return 1;
}else{
return febnacci(i-1)+febnacci(i-2);
}
}
}

Guess you like

Origin www.cnblogs.com/fuqiang-java/p/12308469.html