mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
41 lines
1.7 KiB
HTML
41 lines
1.7 KiB
HTML
<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> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2022/05/10/griddrawio-4.png" style="width: 181px; height: 121px;" />
|
|
<pre>
|
|
<strong>Input:</strong> grid = [[1,1],[3,4]]
|
|
<strong>Output:</strong> 8
|
|
<strong>Explanation:</strong> The strictly increasing paths are:
|
|
- Paths with length 1: [1], [1], [3], [4].
|
|
- Paths with length 2: [1 -> 3], [1 -> 4], [3 -> 4].
|
|
- Paths with length 3: [1 -> 3 -> 4].
|
|
The total number of paths is 4 + 3 + 1 = 8.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> grid = [[1],[2]]
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong> The strictly increasing paths are:
|
|
- Paths with length 1: [1], [2].
|
|
- Paths with length 2: [1 -> 2].
|
|
The total number of paths is 2 + 1 = 3.
|
|
</pre>
|
|
|
|
<p> </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>
|