# Middle-题目55：329. Longest Increasing Path in a Matrix

65人阅读 评论(0)

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:

nums = [
[9,9,4],
[6,6,8],
[2,1,1]
]
Return 4
The longest increasing path is [1, 2, 6, 9].

public class Solution {
int max = 1;
public int longestIncreasingPath(int[][] matrix) {
if (matrix==null || matrix.length==0 || matrix[0].length==0)
return 0;
int[][] lenBoard = new int[matrix.length][matrix[0].length];
int[][] dir = new int[][] { {0,0,1,-1}, {-1,1,0,0} };
for (int i=0; i<matrix.length; ++i) {
for (int j=0; j<matrix[0].length; ++j) {
if (lenBoard[i][j] == 0) {
dfs(matrix, lenBoard, dir, i, j, Integer.MIN_VALUE);
}
}
}
return max;
}

private int dfs(int[][] mat, int[][] lenBoard, int[][] dir, int row, int col, int prev) {
if (row<0 || row>=mat.length || col<0 || col>=mat[0].length || prev>=mat[row][col]) {
return 0;  // out of board or path stops incresing
}
if (lenBoard[row][col] > 0) { return lenBoard[row][col]; }  // current position already computed
int neighborMax = 0;
for (int i=0; i<4; ++i) {  // retrieve the length of lip from its 4 neighbors
neighborMax = Math.max(neighborMax, dfs(mat, lenBoard, dir, row+dir[0][i], col+dir[1][i], mat[row][col]));
}
int localMax = 1 + neighborMax;
lenBoard[row][col] = localMax;
max = Math.max(max, localMax);
return localMax;
}
}

16ms,beats 64.61%，众数16ms，19.26%
Cmershen的碎碎念：

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：55665次
• 积分：3195
• 等级：
• 排名：第10669名
• 原创：270篇
• 转载：53篇
• 译文：0篇
• 评论：7条
文章分类
最新评论