矩形覆盖

题目描述

代码

class Solution {
public:
int rectCover(int number) {
if (number <= 1) {
return number;
}
//dp
= dp[n - 1] + dp[n - 2]
int dp0 = 1, dp1 = 1, dp2;
for (int i = 2; i <= number; ++i) {
dp2 = dp1 + dp0;
dp0 = dp1;
dp1 = dp2;
}
return dp2;
}
};