題目描述

題解：

直接找規律，發現a[i] = a[i - 1] + a[i - 2];

public class Solution {
    public int RectCover(int target) {
        if(0 == target){
            return 0;
        }else if(1 == target){
            return 1;
        }
        
 
int[] res = new int[target+1];
        res[0] = 1;
        res[1] = 1;
        for(int i = 2; i <= target; i++){
            res[i] = res[i-1] + res[i-2];
        }
        return res[target];
    }
}

華為上機機試練習--------------------矩形覆蓋---------------------java語言描述