题解 | #斐波那契数列# [P0]
斐波那契数列
http://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
public class Solution {
public int Fibonacci(int n) {
if (n <= 2) return 1;
int f_a = 1;
int f_b = 1;
for (int i = 3; i<=n; ++i) {
int tmp = f_a + f_b;
f_a = f_b;
f_b = tmp;
}
return f_b;
}
}
DP是真的烦 文章被收录于专栏
只是为了把DP的题集中一下方便自己复习
