Domino and Tromino Tiling LeetCode solution in Java

1
class Solution {
2
  public int numTilings(int n) {
3
    long[] dp = new long[n + 3];
4
    dp[0] = 1;
5
    dp[1] = 2;
6
    dp[2] = 5;
7
    for (int i = 3; i < n; i++) {
8
      dp[i] = (dp[i - 1] * 2 + dp[i - 3]) % 1000000007;
9
    }
10
    return (int) dp[n - 1];
11
  }
12
}