这道题在分类在递归，所以我依然用递归解答，

这道题在分类在递归，所以我依然用递归解答，
类似于斐波那契数列 第n个是n-1和n-2的zhi'h
public class Solution {
public int rectCover(int target) {
if(target ==1 ){return 1;}
if(target == 0){return 0;}
return rectCover1(target);

}
public int rectCover1(int target){
    if(target ==1 ){return 1;}
    if(target == 0){return 1;}
    return rectCover1(target-1)+rectCover1(target-2);
}

}