Package g1401_1500.s1411_number_of_ways_to_paint_n_3_grid

Class Solution

java.lang.Object
g1401_1500.s1411_number_of_ways_to_paint_n_3_grid.Solution
public class Solution extends java.lang.Object
1411 - Number of Ways to Paint N × 3 Grid.

Hard

You have a grid of size n x 3 and you want to paint each cell of the grid with exactly one of the three colors: Red , **Yellow, ** or Green while making sure that no two adjacent cells have the same color (i.e., no two cells that share vertical or horizontal sides have the same color).

Given n the number of rows of the grid, return the number of ways you can paint this grid. As the answer may grow large, the answer must be computed modulo 109 + 7.

Example 1:

Input: n = 1

Output: 12

Explanation: There are 12 possible way to paint the grid as shown.

Example 2:

Input: n = 5000

Output: 30228214

Constraints:

  • n == grid.length
  • 1 <= n <= 5000

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    int
    numOfWays(int n)
     

    Methods inherited from class java.lang.Object

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

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • numOfWays

      public int numOfWays(int n)