面试题10- I. 斐波那契数列(动态规划,清晰图解)
你以为只是简单的f(n)=f(n-1)+f(n-2)?
class Solution {
public:
int fib(int n) {
int a=0,b=1,sum;
for(int i=0;i<n;i++){
sum=(a+b)%1000000007;
a=b;
b=sum;
}
return a;
}
};
class Solution {
public:
int numWays(int n) {
int a=1,b=1,sum; // a=1
for(int i=0;i<n;i++){
sum=(a+b)%1000000007;
a=b;
b=sum;
}
return a;
}
};