LeetCoed 5383. 给 N x 3 网格图涂色的方案数

最新推荐文章于 2021-03-07 10:55:10 发布

vision泉

最新推荐文章于 2021-03-07 10:55:10 发布

阅读量247

点赞数

本文链接：https://blog.csdn.net/weixin_38603360/article/details/105467377

版权

5383. 给 N x 3 网格图涂色的方案数

分类：ABA, ABC各6种，每个ABA可与2ABC+3ABA结合，每个ABC可与2ABC+2ABA结合

class Solution:
    def numOfWays(self, n: int) -> int:
        same, diff = 6, 6  # 代表初始时第一行两类各6种
        for k in range(1, n):
            same, diff = same * 3 + diff * 2, same * 2 + diff * 2
        return (same + diff) % (10 ** 9 + 7)