Domino and Tromino Tiling

[leetcode]Domino and Tromino Tiling

链接：https://leetcode.com/problems/domino-and-tromino-tiling/description/

Question

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 1

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

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

Solution

class Solution {
public:
  #define molNum ((int)pow(10, 9) + 7)
  int numTilings(int N) {
    if (N == 0 || N == 1 || N == 2) return N;
    if (N == 3) return 5;
    vector<int> dp;
    dp.resize(N+1, 0);
    dp[1] = 1;
    dp[2] = 2;
    dp[3] = 5;
    for (int i = 4; i <= N; i++)
      dp[i] = (2*dp[i-1]%molNum + dp[i-3])%molNum;
    return dp[N];
  }
};

思路：这道题是通过找规律得到递推式的，具体可以查看这里。