题目描述
我们可以用2*1的小矩形横着或者竖着去覆盖更大的矩形。请问用n个2*1的小矩形无重叠地覆盖一个2*n的大矩形,总共有多少种方法?
算法分析
斐波那契数列问题,f(1) = 1, f(2) = 2, f(3) = f(1) + f(2), ..., f(n) = f(n-2) + f(n-1), ...
提交代码:
class Solution {
public:
int rectCover(int number) {
if (number < 1)
return 0;
if (number == 1)
return 1;
if (number == 2)
return 2;
int num1 = 1, num2 = 2;
int result;
for (int i = 3; i <= number; ++i)
{
result = num1 + num2;
num1 = num2;
num2 = result;
}
return result;
}
};
测试代码:
// ====================测试代码====================
void Test(const char* testName, int number, int expected)
{
if (testName != nullptr)
printf("%s begins: ", testName);
Solution s;
int result = s.rectCover(number);
if (result == expected)
printf("Passed.\n");
else
printf("Failed.\n");
}
int main(int argc, char* argv[])
{
Test("Test1", 0, 0);
Test("Test2", 1, 1);
Test("Test3", 2, 2);
Test("Test4", 3, 3);
Test("Test5", 5, 8);
Test("Test6", 10, 89);
return 0;
}