790. Domino and Tromino Tiling

We have two types of tiles: a 2x1 domino shape, and an "L" tromino shape. These shapes may be rotated.

XX  <- domino

XX  <- "L" tromino
X

Given N, how many ways are there to tile a 2 x N board? Return your answer modulo 10^9 + 7.

(In a tiling, every square must be covered by a tile. Two tilings are different if and only if there are two 4-directionally adjacent cells on the board such that exactly one of the tilings has both squares occupied by a tile.)

Example:
Input: 3
Output: 5
Explanation: 
The five different ways are listed below, different letters indicates different tiles:
XYZ XXZ XYY XXY XYY
XYZ YYZ XZZ XYY XXY

Note:

• N  will be in range [1, 1000].

思路：记得之前微软也有个类似的面试题，DP，dp[i][0]表示到i个时候刚好填满，dp[i][1]表示到i个时候还缺了一个角（包含缺上面角和下面角）

class Solution:
    def numTilings(self, N):
        """
        :type N: int
        :rtype: int
        """
        if N==1: return 1
        dp = [[0,0] for _ in range(N+1)]
        dp[1][0] = 1
        dp[2][0] = 2
        dp[2][1] = 2
        for i in range(3, N+1):
            dp[i][0] = int((dp[i-1][0]+dp[i-2][0]+dp[i-1][1])%(1e9+7))
            dp[i][1] = int((dp[i-2][0]*2+dp[i-1][1])%(1e9+7))
        return dp[N][0]

s=Solution()
print(s.numTilings(3))
            

想用一维数组搞定

# 不显示的计算出以空位结尾，还是算不出来
class Solution:
    def numTilings(self, N):
        """
        :type N: int
        :rtype: int
        """
        if N==1: return 1
        if N==2: return 2
        dp = [0]*(N+1)
        dp[1] = 1
        dp[2] = 2
        dp[3] = 5
        for i in range(4, N+1):
            dp[i] = int((dp[i-1]+dp[i-2]+2*dp[i-3])%(1e9+7))
        return dp[N]

s=Solution()
print(s.numTilings(3))
            

是错的，如下