Package g0701_0800.s0741_cherry_pickup

Class Solution

java.lang.Object
g0701_0800.s0741_cherry_pickup.Solution
public class Solution extends Object
741 - Cherry Pickup.<p>Hard</p> <p>You are given an <code>n x n</code> <code>grid</code> representing a field of cherries, each cell is one of three possible integers.</p> <ul> <li><code>0</code> means the cell is empty, so you can pass through,</li> <li><code>1</code> means the cell contains a cherry that you can pick up and pass through, or</li> <li><code>-1</code> means the cell contains a thorn that blocks your way.</li> </ul> <p>Return <em>the maximum number of cherries you can collect by following the rules below</em>:</p> <ul> <li>Starting at the position <code>(0, 0)</code> and reaching <code>(n - 1, n - 1)</code> by moving right or down through valid path cells (cells with value <code>0</code> or <code>1</code>).</li> <li>After reaching <code>(n - 1, n - 1)</code>, returning to <code>(0, 0)</code> by moving left or up through valid path cells.</li> <li>When passing through a path cell containing a cherry, you pick it up, and the cell becomes an empty cell <code>0</code>.</li> <li>If there is no valid path between <code>(0, 0)</code> and <code>(n - 1, n - 1)</code>, then no cherries can be collected.</li> </ul> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2020/12/14/grid.jpg" alt="" /></p> <p><strong>Input:</strong> grid = [[0,1,-1],[1,0,-1],[1,1,1]]</p> <p><strong>Output:</strong> 5</p> <p><strong>Explanation:</strong> 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.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> grid = [[1,1,-1],[1,-1,1],[-1,1,1]]</p> <p><strong>Output:</strong> 0</p> <p><strong>Constraints:</strong></p> <ul> <li><code>n == grid.length</code></li> <li><code>n == grid[i].length</code></li> <li><code>1 <= n <= 50</code></li> <li><code>grid[i][j]</code> is <code>-1</code>, <code>0</code>, or <code>1</code>.</li> <li><code>grid[0][0] != -1</code></li> <li><code>grid[n - 1][n - 1] != -1</code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • cherryPickup

      public int cherryPickup(int[][] grid)