Description
You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water.
Grid cells are connected horizontally/vertically (not diagonally). The grid is completely surrounded by water, and there is exactly one island (i.e., one or more connected land cells).
The island doesn’t have “lakes” (water inside that isn’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’t exceed 100. Determine the perimeter of the island.
Example:
Input:
[[0,1,0,0],
[1,1,1,0],
[0,1,0,0],
[1,1,0,0]]
Output: 16
Explanation: The perimeter is the 16 yellow stripes in the image below:
Solution
计算二维数组中1组成的岛屿的周长。
Iterate the array and calculate its 0 neighbors and edge.
Code
class Solution {
public int islandPerimeter(int[][] grid) {
int res = 0;
if (grid.length == 0 || grid[0].length == 0){
return res;
}
for (int i = 0; i < grid.length; i++){
for (int j = 0; j < grid[0].length; j++){
if (grid[i][j] == 1){
if (i == 0 || (i - 1 >= 0 && grid[i - 1][j] == 0)){
res++;
}
if (i == grid.length - 1 || (i + 1 < grid.length && grid[i + 1][j] == 0)){
res++;
}
if (j == 0 || (j - 1 >= 0 && grid[i][j - 1] == 0)){
res++;
}
if ( j == grid[0].length - 1 || (j + 1 < grid[0].length && grid[i][j + 1] == 0)){
res++;
}
}
}
}
return res;
}
}
Time Complexity: O(mn)
Space Complexity: O(1)
Review
Actually we could count the number of islands and its duplicated neighbors then calculate the perimeter. neighbors edge is shared by two squares, so we need to minue twice.
class Solution {
public int islandPerimeter(int[][] grid) {
if (grid.length == 0 || grid[0].length == 0){
return 0;
}
int islands = 0, neighbors = 0;
for (int i = 0; i < grid.length; i++){
for (int j = 0; j < grid[0].length; j++){
if (grid[i][j] == 1){
islands++;
if (i + 1 < grid.length && grid[i + 1][j] == 1){
neighbors++;
}
if (j + 1 < grid[0].length && grid[i][j + 1] == 1){
neighbors++;
}
}
}
}
return islands * 4 - neighbors * 2;
}
}
Time Complexity: O(mn)
Space Complexity: O(1)