【LintCode 简单】749. John's backyard garden

砖墙高度组合问题

最新推荐文章于 2020-10-22 01:51:39 发布

麦片加奶不加糖

最新推荐文章于 2020-10-22 01:51:39 发布

阅读量461

点赞数

CC 4.0 BY-SA版权

分类专栏： # LintCode 文章标签： LintCode Python 递归

本文链接：https://blog.youkuaiyun.com/sinat_23133783/article/details/79114438

LintCode 专栏收录该内容

90 篇文章

订阅专栏

本文探讨了一个关于使用两种不同高度的砖块（3dm和7dm）来搭建任意高度(x dm)墙壁的问题，并提供了一个递归解决方案。文章通过具体实例说明了如何判断是否能用这两种砖块组合出目标高度。

1.问题描述：

John wants to build a back garden on the empty space behind his home. There are two kinds of bricks now, one is 3 dm high and the other is 7 dm high. John wants to enclose a high x dm wall. If John can do this, output YES, otherwise NO.

2.样例：

Give x = 10,return YES.

Explanation:
x = 3 + 7:That is, you need one batch of 3 dm height bricks and one batch of 7 dm height bricks.

Give x = 5,return NO.

Explanation:
John can not enclose a high 5 dm wall with 3 dm height bricks and 7 dm height bricks.

Give x = 13,return YES.

Explanation:
x = 2 * 3 + 7:That is, you need two batch of 3 dm height bricks and one batch of 7 dm height bricks.

3.代码：

class Solution:
    """
    @param x: the wall's height
    @return: YES or NO
    """
    def isBuild(self, x):
        # Write your code here
        if x<0:
            return "NO"
        if x%3 ==0 or x %7 ==0 :
            return "YES"
        else:
            a=x-3
            b=x-7
            return self.isBuild(a) and self.isBuild(b)