Class Solution
java.lang.Object
g2301_2400.s2328_number_of_increasing_paths_in_a_grid.Solution
2328 - Number of Increasing Paths in a Grid.<p>Hard</p>
<p>You are given an <code>m x n</code> integer matrix <code>grid</code>, where you can move from a cell to any adjacent cell in all <code>4</code> directions.</p>
<p>Return <em>the number of <strong>strictly</strong> <strong>increasing</strong> paths in the grid such that you can start from <strong>any</strong> cell and end at <strong>any</strong> cell.</em> Since the answer may be very large, return it <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>
<p>Two paths are considered different if they do not have exactly the same sequence of visited cells.</p>
<p><strong>Example 1:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2022/05/10/griddrawio-4.png" alt="" /></p>
<p><strong>Input:</strong> grid = [[1,1],[3,4]]</p>
<p><strong>Output:</strong> 8</p>
<p><strong>Explanation:</strong> The strictly increasing paths are:</p>
<ul>
<li>
<p>Paths with length 1: [1], [1], [3], [4].</p>
</li>
<li>
<p>Paths with length 2: [1 -> 3], [1 -> 4], [3 -> 4].</p>
</li>
<li>
<p>Paths with length 3: [1 -> 3 -> 4].</p>
</li>
</ul>
<p>The total number of paths is 4 + 3 + 1 = 8.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> grid = [[1],[2]]</p>
<p><strong>Output:</strong> 3</p>
<p><strong>Explanation:</strong> The strictly increasing paths are:</p>
<ul>
<li>
<p>Paths with length 1: [1], [2].</p>
</li>
<li>
<p>Paths with length 2: [1 -> 2].</p>
</li>
</ul>
<p>The total number of paths is 2 + 1 = 3.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>m == grid.length</code></li>
<li><code>n == grid[i].length</code></li>
<li><code>1 <= m, n <= 1000</code></li>
<li><code>1 <= m * n <= 10<sup>5</sup></code></li>
<li><code>1 <= grid[i][j] <= 10<sup>5</sup></code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
countPaths
public int countPaths(int[][] grid)
-