1219. Path with Maximum Gold

 

In a gold mine grid of size m * n, each cell in this mine has an integer representing the amount of gold in that cell, 0 if it is empty.

Return the maximum amount of gold you can collect under the conditions:

• Every time you are located in a cell you will collect all the gold in that cell.
• From your position you can walk one step to the left, right, up or down.
• You can't visit the same cell more than once.
• Never visit a cell with 0 gold.
• You can start and stop collecting gold from any position in the grid that has some gold.

 

Example 1:

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

Example 2:

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

 

Constraints:

• 1 <= grid.length, grid[i].length <= 15
• 0 <= grid[i][j] <= 100
• There are at most 25 cells containing gold.

思路：DFS

class Solution(object):
    def getMaximumGold(self, grid):
        """
        :type grid: List[List[int]]
        :rtype: int
        """
        res=[0]
        n,m=len(grid),len(grid[0])
        dirs=[[1,0],[-1,0],[0,1],[0,-1]]
        vis=[[0 for _ in range(m)] for _ in range(n)]
        
        def dfs(i,j,s):
            res[0]=max(res[0], s)
            for di,dj in dirs:
                ii,jj=i+di,j+dj
                if 0<=ii<n and 0<=jj<m and grid[ii][jj]>0 and not vis[ii][jj]:
                    vis[ii][jj]=True
                    dfs(ii,jj,grid[ii][jj]+s)
                    vis[ii][jj]=False
        
        for i in range(n):
            for j in range(m):
                if grid[i][j]>0:
                    vis[i][j]=True
                    dfs(i,j,grid[i][j])
                    vis[i][j]=False
        return res[0]