LeetCode题解(0790)：多米诺和托米诺平铺(Python)

题目&＃xff1a;原题链接&＃xff08;中等&＃xff09;

标签&＃xff1a;动态规划

解法一&＃xff1a;

class Solution:_MOD &＃61; 10 ** 9 &＃43; 7def numTilings(self, n: int) -> int:now &＃61; [1, 0, 0, 0] # 两行均无空格&＃xff0c;第1行空格&＃xff0c;第2行空格&＃xff0c;两行空格for _ in range(n):nxt &＃61; [0, 0, 0, 0]nxt[0] &＃61; (now[0] &＃43; now[1] &＃43; now[2] &＃43; now[3]) % self._MODnxt[1] &＃61; (now[2] &＃43; now[3]) % self._MODnxt[2] &＃61; (now[1] &＃43; now[3]) % self._MODnxt[3] &＃61; (now[0]) % self._MODnow &＃61; nxtreturn now[0]