Package g0701_0800.s0790_domino_and_tromino_tiling

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    790 - Domino and Tromino Tiling\.

    Medium

    You have two types of tiles: a 2 x 1 domino shape and a tromino shape. You may rotate these shapes.

    Given an integer n, return the number of ways to tile an 2 x n board. Since the answer may be very large, return it modulo <code>10<sup>9</sup> + 7</code>.

    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: n = 3

    Output: 5

    Explanation: The five different ways are show above.

    Example 2:

    Input: n = 1

    Output: 1

    Constraints:

    • 1 &lt;= n &lt;= 1000

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer numTilings(Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait