题解 | #矩形覆盖#
矩形覆盖
https://www.nowcoder.com/practice/72a5a919508a4251859fb2cfb987a0e6
class Solution {
public:
int bp[40];
int rectCover(int number) {
bp[1] = 1;
bp[2] = 2;
for(int i = 3; i<=number; i++){
bp[i] = bp[i-1] + bp[i-2];
}
return bp[number];
}
};
投递快手等公司7个岗位