其实就是一个斐波纳妾数列问题

public class Solution {
    public int RectCover(int target) {
        if(target<=2){
            return target;
        }else{
            return RectCover(target-1)+RectCover(target-2);
        }}}