题解 | #矩形覆盖#
矩形覆盖
https://www.nowcoder.com/practice/72a5a919508a4251859fb2cfb987a0e6?tpId=265&rp=1&ru=%2Fexam%2Foj%2Fta&qru=%2Fexam%2Foj%2Fta&sourceUrl=%2Fexam%2Foj%2Fta%3FjudgeStatus%3D3%26page%3D1%26pageSize%3D50%26search%3D%26tpId%3D13%26type%3D265&difficulty=&judgeStatus=3&tags=&title=&gioEnter=menu
class Solution {
public:
int rectCover(int number) {
// dp[i] 表示2*i的矩形块的覆盖方法数
std::vector<int> dp(number + 1, 0);
dp[1] = 1;
dp[2] = 2;
// 2*1 和 1*2 两种摆放方式
for (int i = 3; i <= number; ++i) {
dp[i] = dp[i - 1] + dp[i - 2];
}
return dp[number];
}
};
凡岛公司福利 737人发布