Path with Maximum Gold Python Solution

lcpy gen -n 1219   # by problem number
lcpy gen -s path_with_maximum_gold   # by problem name

Input: grid = [[0,6,0],[5,8,7],[0,9,0]]
Output: 24
Explanation:
Path to get the maximum gold, 9 -> 8 -> 7.

Input: grid = [[1,0,7],[2,0,6],[3,4,5],[0,3,0],[9,0,20]]
Output: 28
Explanation:
Path to get the maximum gold, 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7.

class Solution:
    # Time: O(25 * 4^25) worst case, bounded by gold cells
    # Space: O(rows * cols)
    def get_maximum_gold(self, grid: list[list[int]]) -> int:
        rows, cols = len(grid), len(grid[0])

        def dfs(row: int, col: int) -> int:
            if row < 0 or row >= rows or col < 0 or col >= cols or grid[row][col] == 0:
                return 0
            gold = grid[row][col]
            grid[row][col] = 0
            best = gold + max(
                dfs(row + 1, col),
                dfs(row - 1, col),
                dfs(row, col + 1),
                dfs(row, col - 1),
            )
            grid[row][col] = gold
            return best

        return max((dfs(row, col) for row in range(rows) for col in range(cols)), default=0)