#2684
Maximum Number of Moves in a Grid
specialist · 730 · lc medium +31 · verified · 58.8% accepted · 953 likes · top 55%
Description
Given a 0-indexed m x n positive-integer matrix grid, start at any cell in the first column. From (row, col) you may step to (row-1, col+1), (row, col+1), or (row+1, col+1) only when the destination value is strictly greater. Return the maximum number of such steps achievable.
Example 1:
Input: grid = [[2,4,3,5],[5,4,9,3],[3,4,2,11],[10,9,13,15]]
Output: 3
Explanation: We can start at the cell (0, 0) and make the following moves:
- (0, 0) -> (0, 1).
- (0, 1) -> (1, 2).
- (1, 2) -> (2, 3).
It can be shown that it is the maximum number of moves that can be made.
Example 2:
Input: grid = [[3,2,4],[2,1,9],[1,1,7]]
Output: 0
Explanation: Starting from any cell in the first column we cannot perform any moves.
Code
1
2
3