package lsn1.sjjg.cct.cn.lsn1; import org.junit.Test; /** * 递归实现菲波那切数列 * * Created by linyaokui on 17/11/28. */ public class Fibonacci { @Test public void test(){ System.out.print(fibonacci(6)); } //菲波那切数列 1 1 2 3 5 8 13 21 34 55 89 public int fibonacci(int n){ if(n == 1 || n == 2){ return 1; }else{ return fibonacci(n-1) + fibonacci(n-2); } } }
菲波那切数列
最新推荐文章于 2020-05-20 08:51:25 发布