class Solution {
public:
int fib(int n) {
int dp[110];
dp[0] = 0;
dp[1] = 1;
for(int i=2; i<=n; i++){
dp[i] = (dp[i-1]+dp[i-2])%1000000007;
}
return dp[n];
}
};
简单dp,斐波那契数列,和爬楼梯,跳青蛙一样