摘要:题目:求Fibonacci数列:1,1,2,3,5,8,……第n个数的值(假设n=40)。思路:Fibonacci数列满足递推公式:F(1)=1,F(2)=1,F(n)=F(n-1) + F(n-2)解法1:递归 1 public class Fibonacci { 2 public static void main(String[] args) { 3 System.out.println(f(40)); 4 } 5 6 public static int f(int n) { 7 if (n == 1 || n ==...
阅读全文