leetcode学习笔记57

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.

class Solution {
    public int longestIncreasingPath(int[][] matrix) {
        if(matrix.length==0)return 0;
        int res=0;
        int m=matrix.length,n=matrix[0].length;
        int[][] dp=new int[m][n];
         for(int i=0;i<matrix.length;i++){
            for(int j=0;j<matrix[0].length;j++){
                res=Math.max(res,dfs(matrix,dp,i,j,m,n));
            }
         }
        return res;
    }
    public int dfs(int[][] matrix,int[][] dp,int i,int j,int m,int n) {
        if(dp[i][j]>0)return dp[i][j];
        int left=1,right=1,up=1,down=1;
        if(j>0&&matrix[i][j]>matrix[i][j-1]){
            left=1+dfs(matrix,dp,i,j-1,m,n);
        }
        if(j<n-1&&matrix[i][j]>matrix[i][j+1]){
            right=1+dfs(matrix,dp,i,j+1,m,n);
        }
        if(i>0&&matrix[i][j]>matrix[i-1][j]){
            up=1+dfs(matrix,dp,i-1,j,m,n);        
        }
        if(i<m-1&&matrix[i][j]>matrix[i+1][j]){
            down=1+dfs(matrix,dp,i+1,j,m,n); 
        }
        dp[i][j]=Math.max(Math.max(left,right),Math.max(up,down));
        return dp[i][j];
    }
}