zoukankan      html  css  js  c++  java
  • LeetCode 741. Cherry Pickup

    原题链接在这里:https://leetcode.com/problems/cherry-pickup/

    题目:

    In a N x N grid representing a field of cherries, each cell is one of three possible integers.

    • 0 means the cell is empty, so you can pass through;
    • 1 means the cell contains a cherry, that you can pick up and pass through;
    • -1 means the cell contains a thorn that blocks your way.

    Your task is to collect maximum number of cherries possible by following the rules below:

    • Starting at the position (0, 0) and reaching (N-1, N-1) by moving right or down through valid path cells (cells with value 0 or 1);
    • After reaching (N-1, N-1), returning to (0, 0) by moving left or up through valid path cells;
    • When passing through a path cell containing a cherry, you pick it up and the cell becomes an empty cell (0);
    • If there is no valid path between (0, 0) and (N-1, N-1), then no cherries can be collected.

    Example 1:

    Input: grid =
    [[0, 1, -1],
     [1, 0, -1],
     [1, 1,  1]]
    Output: 5
    Explanation: 
    The player started at (0, 0) and went down, down, right right to reach (2, 2).
    4 cherries were picked up during this single trip, and the matrix becomes [[0,1,-1],[0,0,-1],[0,0,0]].
    Then, the player went left, up, up, left to return home, picking up one more cherry.
    The total number of cherries picked up is 5, and this is the maximum possible.

    Note:

    • grid is an N by N 2D array, with 1 <= N <= 50.
    • Each grid[i][j] is an integer in the set {-1, 0, 1}.
    • It is guaranteed that grid[0][0] and grid[N-1][N-1] are not -1.

    题解:

    It could be understanding as two people collecting cheeries from (n-1, n-1) to (0, 0).

    Two people cooridinates are (x1, y1), (x2, y2).

    dfs(x1, y1, x2, y2) returns maximum cheeries collected from two cooridinates to (0, 0).

    Thus max(x1, y1, x2, y2) = grid[x1][y1] + grid[x2][y2] + max(dfs(x1-1, y1, x2-1, y2), dfs(x1, y1-1, x2, y2-1), dfs(x1-1, y1, x2, y2-1), dfs(x1, y1-1, x2-1, y2)).

    First person could move from top, or left. Second person could do the same. Totally 4 combinations.

    And of cource, if x1==y1, which means both people are on the same grid, its cheery can't be collected twice.

    y2 = x1+y1-x2. since both of them have same total steps.

    Time Complexity: O(n^3).

    Space: O(n^3).

    AC Java:

     1 class Solution {
     2     int [][][] dp;
     3     int n;
     4     public int cherryPickup(int[][] grid) {
     5         if(grid == null || grid.length == 0 || grid[0].length == 0){
     6             return 0;
     7         }
     8         
     9         n = grid.length;
    10         dp = new int[n][n][n];
    11         for(int i = 0; i<n; i++){
    12             for(int j = 0; j<n; j++){
    13                 Arrays.fill(dp[i][j], Integer.MIN_VALUE);
    14             }
    15         }
    16         
    17         return Math.max(0, dfs(grid, n-1, n-1, n-1));
    18     }
    19     
    20     private int dfs(int [][] grid, int x1, int y1, int x2){
    21         int y2 = x1+y1-x2;
    22         if(x1<0 || y1<0 || x2<0 || y2<0){
    23             return -1;
    24         }
    25         
    26         if(grid[x1][y1]<0 || grid[x2][y2]<0){
    27             return -1;
    28         }
    29         
    30         if(dp[x1][y1][x2] != Integer.MIN_VALUE){
    31             return dp[x1][y1][x2];
    32         }
    33         
    34         if(x1==0 && y1==0){
    35             dp[0][0][0] = grid[0][0];
    36             return grid[0][0];
    37         }
    38         
    39         int res = Math.max(Math.max(dfs(grid, x1-1, y1, x2-1), dfs(grid, x1, y1-1, x2)), Math.max(dfs(grid, x1-1, y1, x2), dfs(grid, x1, y1-1, x2-1)));
    40         if(res < 0){
    41             dp[x1][y1][x2] = -1;
    42             return -1;
    43         }
    44         
    45         res += grid[x1][y1];
    46         if(x1 != x2){
    47             res += grid[x2][y2];
    48         }
    49         
    50         dp[x1][y1][x2] = res;
    51         return res;
    52     }
    53 }
  • 相关阅读:
    原生JavaScript封装insertAfter方法
    SQL截取最后一个由字符分隔的字符串
    给标识列显示的添加数据(IDENTITY_INSERT 为 ON)
    C#保留两位小数,四舍五入的函数及使用方法
    UEditor1.4.3上传图片提示上传失败
    SQL Server 2005公用表表达式(CTE)
    UEditor 粘贴表格时报错导致无法粘贴的解决方法
    事件监听机制
    数组中的趣味题(一)
    redis的工具类封装
  • 原文地址:https://www.cnblogs.com/Dylan-Java-NYC/p/11653409.html
Copyright © 2011-2022 走看看