首页 > 代码库 > 463 Island Perimeter
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. Example: [[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:
- descriptions of this problem implies there may be an "pattern" in calculating the perimeter of the islands.
- and the pattern is
islands * 4 - neighbours * 2
, since every adjacent islands made two sides disappeared(as picture below). - the next problem is: how to find the neighbours without missing or recounting?
+--+ +--+ +--+--+
| | + | | -> | |
+--+ +--+ +--+--+
public static int islandPerimeter(int[][] grid) { if (grid == null || grid.length == 0 || grid[0].length == 0) return 0; int result = 0; for (int i = 0; i < grid.length; i++) { for (int j = 0; j < grid[0].length; j++) { if (grid[i][j] == 1) { result += 4; if (i > 0 && grid[i-1][j] == 1) result -= 2; if (j > 0 && grid[i][j-1] == 1) result -= 2; } } } return result; }
463 Island Perimeter
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。