Fibonacci 动态规划

//0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55,
public class FiB {
public static void main(String[] args) {
System.out.println(Fib(8));
System.out.println(Fib2(8));
}
//迭代
private static int Fib2(int i) {
if (i < 2) {
return i;
}
int f = 0,g = 1;
while (2 <= i–) {
g += f;
f = g - f;
}
return g;
}

// 最普通版
private static int Fib(int i) {
    return i < 2 ? i : Fib(i - 1) + Fib(i - 2);
}

}