1.思路:
可以理解为动态规划或递归,dp[0]=0, dp[1]=1, dp[2]=2, dp[i]=dp[i-1]+dp[i-2];
2.代码:
class Solution {
public:
int rectCover(int number) {
if(number == 0) return 0;
if(number == 1) return 1;
if(number == 2) return 2;
return rectCover(number - 1) + rectCover(number - 2);
}
};