题目地址:
https://www.lintcode.com/problem/longest-continuous-increasing-subsequence-ii/description
给定一个二维矩阵 A A A,从某个位置出发,可以向上下左右走一步。问由严格上升数字构成的最长路径的长度。
思路是记忆化搜索。设 f [ i ] [ j ] f[i][j] f[i][j]是从 A [ i ] [ j ] A[i][j] A[i][j]出发的最长上升路径的长度,则 f [ i ] [ j ] f[i][j] f[i][j]可以由 1 1 1加上四周比 A [ i ] [ j ] A[i][j] A[i][j]大的数出发的最长上升路径的长度来更新。如果不存在,那么 f [ i ] [ j ] = 1 f[i][j]=1 f[i][j]=1。代码如下:
public class Solution {
/**
* @param matrix: A 2D-array of integers
* @return: an integer
*/
public int longestContinuousIncreasingSubsequence2(int[][] matrix) {
// write your code here
if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
return 0;
}
int m = matrix.length, n = matrix[0].length;
int[][] dp = new int[m][n];
int res = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
res = Math.max(res, dfs(i, j, dp, matrix));
}
}
return res;
}
private int dfs(int x, int y, int[][] dp, int[][] matrix) {
// 有记忆,则调取记忆
if (dp[x][y] != 0) {
return dp[x][y];
}
// 先初始化为1
dp[x][y] = 1;
int[] d = {1, 0, -1, 0, 1};
for (int i = 0; i < 4; i++) {
int nextX = x + d[i], nextY = y + d[i + 1];
// 如果没出界,并且可以接上去,就继续DFS
if (0 <= nextX && nextX < matrix.length && 0 <= nextY && nextY < matrix[0].length && matrix[nextX][nextY] > matrix[x][y]) {
dp[x][y] = Math.max(dp[x][y], 1 + dfs(nextX, nextY, dp, matrix));
}
}
return dp[x][y];
}
}
时空复杂度 O ( m n ) O(mn) O(mn)。