JZ10-矩形覆盖
矩形覆盖
https://www.nowcoder.com/practice/72a5a919508a4251859fb2cfb987a0e6?tpId=13&tqId=11163&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking&tab=answerKey
public class Solution {
public int RectCover(int target) {
if(target<=2){
return target;
}
int[] dp = new int[target+1];
dp[0] = 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];
}
} 
美团成长空间 2667人发布
查看15道真题和解析