lintcode 749. 约翰的后花园

约翰想在他家后面的空地上建一个后花园，现在有两种砖，一种3 dm的高度，7 dm的高度。约翰想围成x dm的墙。如果约翰能做到，输出YES，否则输出NO。

样例
Example 1:

Input : x = 10
Output : "YES"
Explanation :
x = 3 + 7:That is, you need one batch of 3 dm height bricks and one batch of 7 dm height bricks.
Example 2:

Input : x = 5
Output : "NO"
Explanation:
John can not enclose a high 5 dm wall with 3 dm height bricks and 7 dm height bricks.
Example 3:

Input : x = 13
Output : "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.
注意事项
X是一个整数，取值范围为 [3, 1000]。

思路1:x每次减去一个7，如果x能被3整除则返回YES.

class Solution {
public:
    /**
     * @param x: the wall's height
     * @return: YES or NO
     */
    string isBuild(int x) {
        // write you code here
      for (int i = 0; x >= 0; i++) {
             
            if(x%3==0){return "YES";break;}
            x-=7;
        }
        return"NO";
    }
};

思路2：凡是大于11的数均可以，所以只要排除11以内不可的数即可。

class Solution {
public:
    /**
     * @param x: the wall's height
     * @return: YES or NO
     */
    string isBuild(int x) {
     for (int a : {1, 2, 4, 5, 8, 11})
            if (x == a) return "NO";
        return "YES";
    }
};