LeetCode 329. Longest Increasing Path in a Matrix（记忆化搜索）

Longest Increasing Path in a Matrix

Hard

Given an integer matrix, find the length of the longest increasing path.

From each cell, you can either move to four directions: left, right, up or down. You may NOT move diagonally or move outside of the boundary (i.e. wrap-around is not allowed).

Example 1:

Input: nums =
[
[9,9,4],
[6,6,8],
[2,1,1]
]
Output: 4
Explanation: The longest increasing path is [1, 2, 6, 9].
Example 2:

Input: nums =
[
[3,4,5],
[3,2,6],
[2,2,1]
]
Output: 4
Explanation: The longest increasing path is [3, 4, 5, 6]. Moving diagonally is not allowed.

思路

记忆化搜索，递推式：

maxPath[i][j] = max(maxPath[i-1][j] + 1, if matrix[i][j] > matrix[i-1][j],
					maxPath[i+1][j] + 1, if matrix[i][j] > matrix[i+1][j],
					maxPath[i][j-1] + 1, if matrix[i][j] > matrix[i][j-1],
					maxPath[i][j+1] + 1, if matrix[i][j] > matrix[i][j+1]
)

用递归方式实现，在递归过程中用二维数组cache记录已经计算过的maxPath[i][j]的值

代码

329. Longest Increasing Path in a Matrix
Hard

1207

21

Favorite

Share
Given an integer matrix, find the length of the longest increasing path.

From each cell, you can either move to four directions: left, right, up or down. You may NOT move diagonally or move outside of the boundary (i.e. wrap-around is not allowed).

Example 1:

Input: nums = 
[
  [9,9,4],
  [6,6,8],
  [2,1,1]
] 
Output: 4 
Explanation: The longest increasing path is [1, 2, 6, 9].
Example 2:

Input: nums = 
[
  [3,4,5],
  [3,2,6],
  [2,2,1]
] 
Output: 4 
Explanation: The longest increasing path is [3, 4, 5, 6]. Moving diagonally is not allowed.