1class Solution:
2    def getMaximumGold(self, grid):
3        def dfs(x, y):
4            if x < 0 or y < 0 or x >= len(grid) or y >= len(grid[0]) or grid[x][y] == 0:
5                return 0
6
7            originalGold = grid[x][y]
8            grid[x][y] = 0  # Mark as visited
9            maxGold = 0
10            # Possible directions: down, up, right, left
11            for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:
12                maxGold = max(maxGold, dfs(x + dx, y + dy))
13            grid[x][y] = originalGold  # Backtrack
14            return originalGold + maxGold
15
16        maxGold = 0
17        for i in range(len(grid)):
18            for j in range(len(grid[0])):
19                if grid[i][j] > 0:
20                    maxGold = max(maxGold, dfs(i, j))
21        return maxGold

1