题目描述
我们可以用2*1的小矩形横着或者竖着去覆盖更大的矩形。请问用n个2*1的小矩形无重叠地覆盖一个2*n的大矩形,总共有多少种方法?
题解一:
public class Solution {
public int RectCover(int target) {
int a = 0,b = 1,c = 2;
if(target == 0)
return 0;
else if(target == 1)
return 1;
else if(target == 2)
return 2;
else{
for(int i = 3;i <= target;i++){
a = b + c;
b = c;
c = a;
}
}
return a;
}
}
题解二:
public class Solution {
public int RectCover(int target) {
if(target == 0)
return 0;
else if(target == 1)
return 1;
else if(target == 2)
return 2;
else{
return RectCover(target-1)+RectCover(target-2);
}
}
}