矩阵中的最大递增路径
解题思路:动态规划
class Solution { public int longestIncreasingPath(int[][] matrix) { if(matrix.length==0||matrix[0].length==0){ return 0; } int xlen = matrix.length; int ylen = matrix[0].length; int[][][] flags = new int[xlen][ylen][2]; for(int i=0;i=0&&matrix[i][j]>matrix[i-1][j]&&flags[i][j][1-cur] =0&&matrix[i][j]>matrix[i][j-1]&&flags[i][j][1-cur] matrix[i+1][j]&&flags[i][j][1-cur] matrix[i][j+1]&&flags[i][j][1-cur]
另一种方法:
解题思路:dfs+记忆矩阵