class Solution {
public:
int rectCover(int number) {
int result = 0,first = 1,second = 2;
if(number == 1 || number == 2)
return number;
else
{
for(int i = 3; i <= number; i++)
{
result = first + second;
first = second;
second = result;
}
return result;
}
}
};
剑指offer:矩形覆盖
最新推荐文章于 2024-08-15 20:00:00 发布