2020-02-06

求斐波那契数列的方法

1. java中用循环求斐波那契数列的第n项
   package Perfect;
   import java.util.Scanner;
   public class homework3 {
   public static void main(String[] args) {
   Scanner input=new Scanner(System.in);
   System.out.print(“n为：”);
   int n=input.nextInt();
   System.out.println(fib(n));
   }
   public static int fib(int n) {
   int num1 = 1;
   int num2 = 1;
   int sum = 0;
   for (int i = 3; i <= n; i ) {
   sum = num1 num2;
   num1 = num2;
   num2 = sum;
   }
   return sum; }
   }
   2.java中递归求斐波那契数列的第n项(但当n不断增大，程序的运行速度会越来越慢，因为里面有大量重复运算，所以一般推荐用循环)
   package Perfect;
   import java.util.Scanner;
   public class homework3 {
   public static void main(String[] args) {
   Scanner input=new Scanner(System.in);
   System.out.print(“n为：”);
   int n=input.nextInt();
   System.out.print(fib(n));
   }
   public static int fib(int n){
   if(n1||n2){
   return 1;
   }
   return fib(n-1) fib(n-2);
   }
   }