LeetCode - 463. Island Perimeter
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.
[[0,1,0,0], [1,1,1,0], [0,1,0,0], [1,1,0,0]] Answer: 16 Explanation: The perimeter is the 16 yellow stripes in the image below:
public class Solution { public int islandPerimeter(int[][] grid) { if (grid == null || grid.length <= 0 || grid[0] == null || grid[0].length <= 0) return 0; int high = grid.length, width = grid[0].length; int p = 0; for (int i=0; i<high; i++) { for (int j=0; j<width; j++) { if (grid[i][j] == 1) { if (i <= 0) p++; if (i >= high-1) p++; if (i<high-1 && grid[i+1][j] == 0) p++; if (i>0 && grid[i-1][j] == 0) p++; if (j <= 0) p++; if (j >= width-1) p++; if (j>0 && grid[i][j-1] == 0) p++; if (j<width-1 && grid[i][j+1] == 0) p++; } } } return p; } }
作者:Pickle
声明:对于转载分享我是没有意见的,出于对博客园社区和作者的尊重一定要保留原文地址哈。
致读者:坚持写博客不容易,写高质量博客更难,我也在不断的学习和进步,希望和所有同路人一道用技术来改变生活。觉得有点用就点个赞哈。