斐波那契数列

1 public class Solution {
2     public int Fibonacci(int n) {
3         if (n == 0) return 0;
4         if (n == 1 || n == 2)  return 1;
5         return Fibonacci(n - 2) + Fibonacci(n - 1);
6     }
7 }

 1 public class Solution {
 2     public int Fibonacci(int n) {
 3         int []f = new int[40];
 4         f[0] = 0;
 5         f[1] = f[2] = 1;
 6         for (int i = 3; i <= n; ++i) {
 7             f[i] = f[i - 2] + f[i - 1];
 8         }
 9         return f[n];
10     }
11 }