mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
50 lines
1.5 KiB
HTML
50 lines
1.5 KiB
HTML
<p>In a gold mine <code>grid</code> of size <code>m x n</code>, each cell in this mine has an integer representing the amount of gold in that cell, <code>0</code> if it is empty.</p>
|
|
|
|
<p>Return the maximum amount of gold you can collect under the conditions:</p>
|
|
|
|
<ul>
|
|
<li>Every time you are located in a cell you will collect all the gold in that cell.</li>
|
|
<li>From your position, you can walk one step to the left, right, up, or down.</li>
|
|
<li>You can't visit the same cell more than once.</li>
|
|
<li>Never visit a cell with <code>0</code> gold.</li>
|
|
<li>You can start and stop collecting gold from <strong>any </strong>position in the grid that has some gold.</li>
|
|
</ul>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> grid = [[0,6,0],[5,8,7],[0,9,0]]
|
|
<strong>Output:</strong> 24
|
|
<strong>Explanation:</strong>
|
|
[[0,6,0],
|
|
[5,8,7],
|
|
[0,9,0]]
|
|
Path to get the maximum gold, 9 -> 8 -> 7.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> grid = [[1,0,7],[2,0,6],[3,4,5],[0,3,0],[9,0,20]]
|
|
<strong>Output:</strong> 28
|
|
<strong>Explanation:</strong>
|
|
[[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.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>m == grid.length</code></li>
|
|
<li><code>n == grid[i].length</code></li>
|
|
<li><code>1 <= m, n <= 15</code></li>
|
|
<li><code>0 <= grid[i][j] <= 100</code></li>
|
|
<li>There are at most <strong>25 </strong>cells containing gold.</li>
|
|
</ul>
|