斐波那契数列的三种实现方式
package com.vleus.algorithm.dynamic_programming;
public class Fibonacci {
public static int fib2(int n) {
if (n == 0) return 0;
if(n==1) return 1;
return fib2(n - 2) + fib(n - 1);
}
public static int fib(int n) {
if (n == 0) return 0;
if (n == 1 | n == 2) {
return 1;
}
int pre2 = 1, pre1 = 1;
for (int i = 2; i < n; i++) {
int curr = pre1 + pre2;
pre2 = pre1;
pre1 = curr;
pre1 = pre1 % 1000000007;
}
return pre1;
}
public static void main(String[] args) {
System.out.println(Fibonacci.fib2(9));
}
}