Longest increasing path in a matrix
Harddynamic programmingdfsmemoizationmatrix
Moving up/down/left/right, you may only step to a cell with a larger value. Return the number of cells on the longest such path.
Example 1
Input: matrix = [[9,9,4],[6,6,8],[2,1,1]] Output: 4
1 → 2 → 6 → 9.
Example 2
Input: matrix = [[3,4,5],[3,2,6],[2,2,1]] Output: 4
Constraints
- 1 ≤ rows, cols ≤ 200
- 0 ≤ matrix[r][c] ≤ 2³¹ - 1
Submit checks your solution against 8 tests, including hidden ones.
/**
* @param {int[][]} matrix
* @return {int}
*/
function longestIncreasingPath(matrix) {
}