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 Object

1411 - Number of Ways to Paint N × 3 Grid.<p>Hard</p> <p>You have a <code>grid</code> of size <code>n x 3</code> and you want to paint each cell of the grid with exactly one of the three colors: <strong>Red</strong> , **Yellow, ** or <strong>Green</strong> 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).</p> <p>Given <code>n</code> the number of rows of the grid, return <em>the number of ways</em> you can paint this <code>grid</code>. As the answer may grow large, the answer <strong>must be</strong> computed modulo <code>10⁹ + 7</code>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2020/03/26/e1.png" alt="" /></p> <p><strong>Input:</strong> n = 1</p> <p><strong>Output:</strong> 12</p> <p><strong>Explanation:</strong> There are 12 possible way to paint the grid as shown.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> n = 5000</p> <p><strong>Output:</strong> 30228214</p> <p><strong>Constraints:</strong></p> <ul> <li><code>n == grid.length</code></li> <li><code>1 <= n <= 5000</code></li> </ul>

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)