程式語言 - LeetCode - C++ - 790. Domino and Tromino Tiling



參考資訊:
https://www.cnblogs.com/grandyang/p/9179556.html

題目:


方法:


解答:

class Solution {
public:
    int numTilings(int n) {
        int i = 0;
        long dp[1000] = { 1, 1, 2 };
        long mod = 1e9 + 7;
    
        for (i = 3; i <= n; i++) {
            dp[i] = ((dp[i - 1] * 2) + dp[i - 3]) % mod;
        }
    
        return dp[n];
    }
};