LeetCode: 329. Longest Increasing Path in a Matrix
题目描述
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.
解题思路 —— 记忆搜索
根据题目意思记忆搜索
AC 代码
func max(x, y int) int {
if x > y {
return x
} else {
return y
}
}
func dfsWithRemeber(matrix [][]int, record [][]int, x int, y int) int {
if len(matrix) == 0 {
return 0
}
if record[x][y] != -1 {
return record[x][y]
}
dirs := [][2]int{
{ 1, 0 }, // down
{ -1, 0 }, // up
{ 0, 1 }, // right
{ 0, -1 }, // left
}
ans := 1
for i := 0; i < len(dirs); i++ {
tx := x + dirs[i][0]
ty := y + dirs[i][1]
if tx >= len(matrix) || tx < 0 || ty >= len(matrix[0]) || ty < 0 {
continue
}
if matrix[tx][ty] <= matrix[x][y] {
continue
}
ans = max(ans, dfsWithRemeber(matrix, record, tx, ty)+1)
}
record[x][y] = ans
return ans
}
func longestIncreasingPath(matrix [][]int) int {
record := make([][]int, len(matrix))
for i := 0; i < len(matrix); i++ {
for j := 0; j < len(matrix[i]); j++ {
record[i] = append(record[i], -1)
}
}
ans := 0
for i := 0; i < len(matrix); i++ {
for j := 0; j < len(matrix[i]); j++ {
ans = max(ans, dfsWithRemeber(matrix, record, i, j))
}
}
return ans
}