摘要： 非递归写法 static int FibonacciNumber(int n) { int a = 0; int b = 1; int tmp; for (int i = 0; i _cache = new Dictionary(); private int Fib(int n) = n Gener 阅读全文