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);
}
}
原文：https://www.cnblogs.com/kexiblog/p/10885138.html