Fibonacci数列的一点思考哈哈
Fibonacci数列对于我们计算机的学生来说,太熟悉不过,但是今天在看书的时候还是发现了点新的东西。
一般的找出Fibonacci数的方法如下:
public static long fib(long index){if (index == 0) {return 0;}else if(index == 1){return 1;}else{return fib(index - 1)+fib(index -2);}}
package MyAlgorithom;import java.util.Scanner;public class ImprovedFibonacci {public static void main(String[] args) {/*创建一个用户输入*/Scanner scanner = new Scanner(System.in);System.out.println("输入一个Fibonacci数列的index:");int index = scanner.nextInt();System.out.println("Fibonacci number at index"+index+" is "+fib(index));}public static long fib(long n){long f0 = 0;long f1 = 1;long f2 = 1;if (n == 0) {return f0;} else if(n == 1){return f1;} else if(n == 2){return f2;}for (int i = 3; i <= n; i++) {f0 = f1;f1 = f2;f2 = f1+f0;}return f2;}}