原题链接:https://leetcode-cn.com/problems/fei-bo-na-qi-shu-lie-lcof/
int fib(int n) {
if (n == 0 || n == 1) return n;
const int MOD = 1000000007;
vector<int> dp(n+1, 0);
dp[0] = 0;
dp[1] = 1;
for (int i = 2; i <= n; i++) {
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD;
}
return dp[n];
}