题解 | #矩形覆盖#

public class Solution {
    public int rectCover(int target) {
        if(target == 0) {
            return 0;
        }
        int[] dp = new int[target + 1];
        dp[0] = 1;
        dp[1] = 1;
        for(int i = 2; i < dp.length; i++) {
            dp[i] = dp[i - 1] + dp[i - 2];
        }
        return dp[target];        
    }
}