class Solution:

    def maxMoves(self, grid: List[List[int]]) -> int:

        dp = [[0 for _ in range(len(grid[0]))] for _ in range(len(grid))]

        ans = 0

        for j in range(1, len(grid[0])):

            for i in range(len(grid)):

                if i > 0 and grid[i-1][j-1] < grid[i][j] and dp[i-1][j-1] == j-1:

                    ans, dp[i][j] = j, j

                if grid[i][j-1] < grid[i][j] and dp[i][j-1] == j-1:

                    ans, dp[i][j] = j, j

                if i < len(grid) - 1 and grid[i+1][j-1] < grid[i][j] and dp[i+1][j-1] == j-1:

                    ans, dp[i][j] = j, j

        return ans

그냥 앞칸만 보고 가면 된다. 어제보다 쉬운 느낌