题解 | #矩形覆盖#

class Solution {
public:
    int rectCover(int number) {
        if(number == 0) return 0;//根据约定，返回0
        vector<int> dp(number+1, 1);
        dp[1] = 1;
        dp[2] = 2;
        for(int i = 3; i <= number; ++i)
        {
            dp[i] = dp[i-1] + dp[i-2];//找规律，当前的是上次和上上次的总和
        }
        //std::cout << dp[number] << std::endl;
        return dp[number];
    }
};