LC329. 矩阵中的最长递增路径

回溯加记忆，记忆的原因是在for循环里回溯时会遇到已经计算过的值，避免重复计算

def longestIncreasingPath(self, matrix):
        """
        :type matrix: List[List[int]]
        :rtype: int
        """
        if not matrix:
            return 0
        save = [[0 for i in range(len(matrix[0]))] for _ in range(len(matrix))]
        def dfs(x,y):
            if save[x][y]:
                return save[x][y]
            save[x][y] = 1
            for nx,ny in [(x,y+1),(x,y-1),(x+1,y),(x-1,y)]:
                if 0 <= nx < len(matrix) and 0 <= ny < len(matrix[0]) and matrix[nx][ny] > matrix[x][y]:
                    save[x][y] =  max(save[x][y],dfs(nx,ny)+1)
            return save[x][y]
        res = 0
        for i in range(len(matrix)):
            for j in range(len(matrix[0])):
                res = max(res,dfs(i,j))
        return res