联想校园招聘笔试题

补全斐波那契数列的动态规划实现代码 int fib(int n) { int f[n + 2]; f[0] = 0; f[1] = 1; for (int i = 2; i <= n; i++) { f[i] = f[i - 1] + _________; //填空 } return f[n]; }