Leetcode之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.

代码：

class Solution {
public:
    int search(vector<vector<int>>& grid, int i, int j) {
    if (grid[i][j] <= 0)return 0;
    int temp = grid[i][j];
    grid[i][j] = -1;
    int l = 0,r = 0,u = 0, d = 0;
    if (i > 0) {
        u = search(grid, i - 1, j);
    }
    if (i < grid.size()-1) {
        d = search(grid, i + 1, j);
    }
    if (j > 0) {
        l = search(grid, i, j - 1);
    }
    if (j < grid[0].size()-1) {
        r = search(grid, i, j + 1);
    }
    u = max(u, d);
    l = max(l, r);
    u = max(u, l);
    grid[i][j] = temp;
   
    return temp+u;
}
int getMaximumGold(vector<vector<int>>& grid) {
    int h = grid.size(); int w = grid[0].size();
    int res = 0;
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            if (grid[i][j] != 0) {
                int t = search(grid, i, j);
                res = max(res, t);
            }
        }
    }
    return res;
}
};

想法：

注意后面返回的是否对前面有影响，注意现在改变的对以后的结果会不会有影响。