题解 | #矩形覆盖#

矩形覆盖

http://www.nowcoder.com/practice/72a5a919508a4251859fb2cfb987a0e6

力扣滚动数组

public class Solution {
    public int rectCover(int target) {
        if (target == 0) {
            return 0;
        }

        int p = 0, q = 1, r = 1;

        for (int i = 1; i < target; i++) {
            p = q;
            q = r;
            r = p + q;
        }

        return r;
    }
}
全部评论

相关推荐

点赞 收藏 评论
分享
牛客网
牛客企业服务