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:

1. Every time you are located in a cell you will collect all the gold in that cell.
2. From your position, you can walk one step to the left, right, up or down.
3. You can’t visit the same cell more than once.
4. Never visit a cell with 0 gold.
5. 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 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 Path to get the maximum gold, 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7.


To find maximum gold we need to explore all possible solution from all the none zero gold points. We can do DFS from each none zero gold point and return maximum gold from that.




We acknowledge you to write a comment if you have a better solution or having any doubt on the above topic.

Leave a Reply

Your email address will not be published. Required fields are marked *