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.

分析：可以用一个数组，其中数组中的每个元素记录从该位置出发的最长递增路径，这样可以减少计算

class Solution(object):
    
    def dfs(self, matrix, visited, row, col, current):
        
        if row<0 or row>=len(matrix) or col<0 or col>=len(matrix[0]) or matrix[row][col]<=current:
            return 0
        if visited[row][col]>0:   #这个一定要加上，不然超时，表示已经计算出来了
            return visited[row][col]
        bottom = self.dfs(matrix,visited,row+1,col,matrix[row][col])+1
        top = self.dfs(matrix,visited,row-1,col,matrix[row][col])+1
        right = self.dfs(matrix,visited,row,col+1,matrix[row][col])+1
        left = self.dfs(matrix,visited,row,col-1,matrix[row][col])+1
        visited[row][col]=max(bottom,top,right,left)
        return visited[row][col]
        
        
    def longestIncreasingPath(self, matrix):
        """
        :type matrix: List[List[int]]
        :rtype: int
        """
        if len(matrix)==0:
            return 0
        res=0
        visited=[[0 for j in range(len(matrix[0]))] for i in range(len(matrix))]
        for i in range(len(matrix)):
            for j in range(len(matrix[0])):
                if res<self.dfs(matrix,visited,i,j,-1):
                    res=self.dfs(matrix,visited,i,j,-1)
        return res