剑指Offer第十题:矩形覆盖
我们可以用21的小矩形横着或者竖着去覆盖更大的矩形。请问用n个21的小矩形无重叠地覆盖一个2*n的大矩形,总共有多少种方法?
根据第一个矩形是横着还是竖着分为两种
递归
public class Solution {
public int RectCover(int target) {
if(target <= 0){
return 0;
}
if(target == 1){
return 1;
}
if(target == 2){
return 2;
}
else{
return RectCover(target - 1) + RectCover(target - 2);
}
}
}
循环
public int RectCover(int target) {
if(target <= 0){
return 0;
}
if(target == 1){
return 1;
}
if(target == 2){
return 2;
}
int first = 1;
int second = 2;
int res = 3;
for(int i = 3; i<= target; i++){
res = first+second;
first = second;
second = res;
}
return res;
}