zoukankan      html  css  js  c++  java
  • LeetCode 1219. Path with Maximum Gold

    原题链接在这里:https://leetcode.com/problems/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.

    题解:

    For each cell in the grid, start DFS.

    DFS state is current index. And it should return starting at current index, the maximum glod it could get.

    If current index is illegal, return 0.

    Otherwise, return grid[i][j] + for each direction, do DFS, get the maximum among 4 directions, and return.

    Before return, backtracking grid[i][j] to its original value.

    Time Complexity:  O(m^2*n^2).

    Space: O(m*n). m = grid.length. n = grid[0].length.

    AC Java:

     1 class Solution {
     2     int res = 0;
     3     int [][] dirs = new int[][]{{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
     4     
     5     public int getMaximumGold(int[][] grid) {
     6         int m = grid.length;
     7         int n = grid[0].length;
     8         
     9         for(int i = 0; i < m; i++){
    10             for(int j = 0; j < n; j++){
    11                 if(grid[i][j] != 0){
    12                     res = Math.max(res, dfs(grid, i, j, m, n));
    13                 }
    14             }
    15         }
    16         
    17         return res;
    18     }
    19     
    20     private int dfs(int [][] grid, int i, int j, int m, int n){
    21         if(i < 0 || i >= m || j < 0 || j >= n || grid[i][j] == 0){
    22             return 0;
    23         }
    24         
    25         int gold = grid[i][j];
    26         grid[i][j] = 0;
    27         int max = 0;
    28         for(int [] dir : dirs){
    29             max = Math.max(max, dfs(grid, i + dir[0], j + dir[1], m, n));
    30         }
    31         
    32         grid[i][j] = gold;
    33         return gold + max;
    34     }
    35 }
  • 相关阅读:
    hdu 14004
    hdu 1850 基础尼姆博奕
    hdu 1847 sg函数
    hdu 2177
    hdu 1527
    hdu 2897
    hdu 2516 取石子游戏
    hdu 1525 Euclid's Game
    hdu 2063
    hdu 1281 棋盘游戏
  • 原文地址:https://www.cnblogs.com/Dylan-Java-NYC/p/11791324.html
Copyright © 2011-2022 走看看