思路:小矩形为2*1,目标大矩形为2*target,则考虑最终情形剩余2*2和2*1两种,此时可以运用斐波那契数列方法,f(n) = f(n-1) + f(n-2)
代码:
public class Solution {
public int RectCover(int target) {
return rectCover(target);
}
static 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);
}
}
end