SuryaPratapK
/ Maximum Number of Moves in a Grid | Leetcode 2684
Created
October 29, 2024 08:40
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| int maxMoves(int r,int c,vector<vector<int>>& grid,vector<vector<int>>& mem){ | |
| if(mem[r][c]!=-1) return mem[r][c]; | |
| int max_moves=0; | |
| if(r-1>=0 and c+1<grid[0].size() and grid[r-1][c+1]>grid[r][c]) | |
| max_moves = 1 + maxMoves(r-1,c+1,grid,mem); | |
| if(c+1<grid[0].size() and grid[r][c+1]>grid[r][c]) | |
| max_moves = max(max_moves, 1 + maxMoves(r,c+1,grid,mem)); | |
| if(r+1<grid.size() and c+1<grid[0].size() and grid[r+1][c+1]>grid[r][c]) |