mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-26 02:00:27 +08:00
42 lines
1.8 KiB
HTML
42 lines
1.8 KiB
HTML
|
<p>给你一个下标从 <strong>0</strong> 开始、大小为 <code>m x n</code> 的矩阵 <code>grid</code> ，矩阵由若干 <strong>正</strong> 整数组成。</p>
|
|||
|
|
|
|||
|
|
<p>你可以从矩阵第一列中的 <strong>任一</strong> 单元格出发，按以下方式遍历 <code>grid</code> ：</p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li>从单元格 <code>(row, col)</code> 可以移动到 <code>(row - 1, col + 1)</code>、<code>(row, col + 1)</code> 和 <code>(row + 1, col + 1)</code> 三个单元格中任一满足值 <strong>严格</strong> 大于当前单元格的单元格。</li>
|
|||
|
|
</ul>
|
|||
|
|
|
|||
|
|
<p>返回你在矩阵中能够 <strong>移动</strong> 的 <strong>最大</strong> 次数。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2023/04/11/yetgriddrawio-10.png" style="width: 201px; height: 201px;">
|
|||
|
|
<pre><strong>输入：</strong>grid = [[2,4,3,5],[5,4,9,3],[3,4,2,11],[10,9,13,15]]
|
|||
|
|
<strong>输出：</strong>3
|
|||
|
|
<strong>解释：</strong>可以从单元格 (0, 0) 开始并且按下面的路径移动：
|
|||
|
|
- (0, 0) -> (0, 1).
|
|||
|
|
- (0, 1) -> (1, 2).
|
|||
|
|
- (1, 2) -> (2, 3).
|
|||
|
|
可以证明这是能够移动的最大次数。</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><img alt="" src="https://assets.leetcode.com/uploads/2023/04/12/yetgrid4drawio.png">
|
|||
|
|
<strong>输入：</strong>grid = [[3,2,4],[2,1,9],[1,1,7]]
|
|||
|
|
<strong>输出：</strong>0
|
|||
|
|
<strong>解释：</strong>从第一列的任一单元格开始都无法移动。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>m == grid.length</code></li>
|
|||
|
|
<li><code>n == grid[i].length</code></li>
|
|||
|
|
<li><code>2 <= m, n <= 1000</code></li>
|
|||
|
|
<li><code>4 <= m * n <= 10<sup>5</sup></code></li>
|
|||
|
|
<li><code>1 <= grid[i][j] <= 10<sup>6</sup></code></li>
|
|||
|
|
</ul>
|