代码
class Solution {
public:
int rectCover(int number) {
if (number == 0) return 0;
if (number == 1) return 1;
int dp[number+1];
dp[0]=1;
dp[1]=1;
for (int i=2;i<=number+1;i++){
dp[i] = dp[i-1] + dp[i-2];
}
return dp[number];
}
};
思路