JZ10 矩形覆盖
矩形覆盖
https://www.nowcoder.com/practice/72a5a919508a4251859fb2cfb987a0e6?tpId=13&&tqId=11163&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
public class Solution { public int rectCover(int target) { if(target <=3) return target; int[] dp= new int[target+1]; for(int i=0;i<4;i++){ dp[i] = i; } for(int i=4;i<target+1;i++){ dp[i] = dp[i-1]+dp[i-2]; } return dp[target]; } }