1219. Path with Maximum Gold - LeetCode Solution

class Solution:

    def trav(self, i, j, count, grid_copied):
        if i< 0:
            return count
        if i >= len(grid_copied):
            return count
        if j <0:
            return count

        if j>= len(grid_copied[i]):
            return count

        if grid_copied[i][j] == 0:
            return count
        last = grid_copied[i][j]
        grid_copied[i][j] = 0
        a =  max(self.trav(i+1,j, count+ last, grid_copied),
                   self.trav(i-1,j, count+ last, grid_copied),
                   self.trav(i,j+1, count+ last, grid_copied),
                   self.trav(i,j-1, count+ last, grid_copied))
        grid_copied[i][j] = last
        return a
        

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

        ans = 0
        for i in range(len(grid)):
            for j in range(len(grid[i])):
                if grid[i][j] == 0:
                    continue
                ans = max(ans, self.trav(i, j,0, grid))
        return ans