Package g0401_0500.s0463_island_perimeter

Class Solution

java.lang.Object
g0401_0500.s0463_island_perimeter.Solution
public class Solution extends Object
463 - Island Perimeter.<p>Easy</p> <p>You are given <code>row x col</code> <code>grid</code> representing a map where <code>grid[i][j] = 1</code> represents land and <code>grid[i][j] = 0</code> represents water.</p> <p>Grid cells are connected <strong>horizontally/vertically</strong> (not diagonally). The <code>grid</code> is completely surrounded by water, and there is exactly one island (i.e., one or more connected land cells).</p> <p>The island doesn&rsquo;t have &ldquo;lakes&rdquo;, meaning the water inside isn&rsquo;t connected to the water around the island. One cell is a square with side length 1. The grid is rectangular, width and height don&rsquo;t exceed 100. Determine the perimeter of the island.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2018/10/12/island.png" alt="" /></p> <p><strong>Input:</strong> grid = [[0,1,0,0],[1,1,1,0],[0,1,0,0],[1,1,0,0]]</p> <p><strong>Output:</strong> 16</p> <p><strong>Explanation:</strong> The perimeter is the 16 yellow stripes in the image above.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> grid = [[1]]</p> <p><strong>Output:</strong> 4</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> grid = [[1,0]]</p> <p><strong>Output:</strong> 4</p> <p><strong>Constraints:</strong></p> <ul> <li><code>row == grid.length</code></li> <li><code>col == grid[i].length</code></li> <li><code>1 <= row, col <= 100</code></li> <li><code>grid[i][j]</code> is <code>0</code> or <code>1</code>.</li> <li>There is exactly one island in <code>grid</code>.</li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • islandPerimeter

      public int islandPerimeter(int[][] grid)