题解 | #矩形覆盖#
矩形覆盖
https://www.nowcoder.com/practice/72a5a919508a4251859fb2cfb987a0e6
class Solution {
public:
int rectCover(int number) {
if(number==0) return 0;
int i=1, j=0, temp=0;
while(--number)
{
temp = j;
j = i;
i += temp;
}
return i+j;
}
};
磨砂的指名者 文章被收录于专栏
怎么绘世呢？
算法太卷啦