题目链接:https://leetcode-cn.com/problems/qing-wa-tiao-tai-jie-wen-ti-lcof/
题目如下:
class Solution {
public:
int numWays(int n) {
if(n==0) return 1;
if(n==1) return 1;
#define MOD 1000000007
int dp[n+1];
dp[0]=1;dp[1]=1;
for(int i=2;i<=n;i++)
dp[i]=(dp[i-1]+dp[i-2])%MOD;
return dp[n];
}
};