Package g1101_1200.s1162_as_far_from_land_as_possible

Class Solution

java.lang.Object
g1101_1200.s1162_as_far_from_land_as_possible.Solution
public class Solution extends Object
1162 - As Far from Land as Possible.<p>Medium</p> <p>Given an <code>n x n</code> <code>grid</code> containing only values <code>0</code> and <code>1</code>, where <code>0</code> represents water and <code>1</code> represents land, find a water cell such that its distance to the nearest land cell is maximized, and return the distance. If no land or water exists in the grid, return <code>-1</code>.</p> <p>The distance used in this problem is the Manhattan distance: the distance between two cells <code>(x0, y0)</code> and <code>(x1, y1)</code> is <code>|x0 - x1| + |y0 - y1|</code>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2019/05/03/1336_ex1.JPG" alt="" /></p> <p><strong>Input:</strong> grid = [[1,0,1],[0,0,0],[1,0,1]]</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> The cell (1, 1) is as far as possible from all the land with distance 2.</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2019/05/03/1336_ex2.JPG" alt="" /></p> <p><strong>Input:</strong> grid = [[1,0,0],[0,0,0],[0,0,0]]</p> <p><strong>Output:</strong> 4</p> <p><strong>Explanation:</strong> The cell (2, 2) is as far as possible from all the land with distance 4.</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 <= 100</code></li> <li><code>grid[i][j]</code> is <code>0</code> or <code>1</code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • maxDistance

      public int maxDistance(int[][] grid)