329. Longest Increasing Path in a Matrix

329. Longest Increasing Path in a Matrix

class Solution:
    def longestIncreasingPath(self, matrix: List[List[int]]) -> int:
        m,n=len(matrix),len(matrix[0])
        meno=[[0 for i in range(n)]for j in range(m)]

        def dfs(x,y):
            if meno[x][y]:return meno[x][y]
            dirs=[[-1,0],[1,0],[0,1],[0,-1]]
            res=1
            for d in dirs:
                x1,y1=x+d[0],y+d[1]
                if 0<=x1<m and 0<=y1<n:
                    if matrix[x1][y1]>matrix[x][y]:
                        res=max(dfs(x1,y1)+1,res)
            meno[x][y]=res
            return meno[x][y]

        res=1
        for i in range(m):
            for j in range(n):
                meno[i][j]=dfs(i,j)
                res=max(meno[i][j],res)
        return res