和跳台阶思路一样,没难点
public class Solution {
public int RectCover(int target) {
if(target<3){
return target;
}
int dp[] = new int[target+1];
dp[1] = 1;
dp[2] = 2;
for(int i=3;i<=target;i++){
dp[i] = dp[i-1] + dp[i-2];
}
return dp[target];
}
}