题目描述
我们可以用2*1的小矩形横着或者竖着去覆盖更大的矩形。请问用n个2*1的小矩形无重叠地覆盖一个2*n的大矩形,总共有多少种方法?
画图推算出 f(n)=f(n-1)+f(n-2)
方法一:递归
public class Solution {
public int RectCover(int target) {
if( target == 0 ) return 0;
if( target == 1 ) return 1;
if( target == 2 ) return 2;
return RectCover(target-1) + RectCover(target-2);
}
}
方法二:循环
public class Solution {
public int RectCover(int target) {
if( target == 0 ) return 0;
if( target == 1 ) return 1;
if( target == 2 ) return 2;
int pre = 1;
int now = 2;
int result = 0;
for( int i = 3;i <= target;i++ ) {
result = pre + now;
pre = now;
now = result;
}
return result;
}
}