zoukankan      html  css  js  c++  java
  • 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:
    

     1 public class Solution {
     2     public int islandPerimeter(int[][] grid) {
     3         int islands = 0, neighbors = 0;
     4         for (int i = 0; i < grid.length; i++) {
     5             for (int j = 0; j < grid[i].length; j++) {
     6                 if (grid[i][j] == 1) {
     7                     islands++;
     8                 
     9                     if (i < grid.length - 1 && grid[i + 1][j] == 1) neighbors++;
    10                     if (j < grid[i].length - 1 && grid[i][j + 1] == 1) neighbors++;
    11                 }
    12             }
    13         }
    14         return islands * 4 - neighbors * 2;
    15     }
    16 }
  • 相关阅读:
    双向链表循环
    双向链表的删除操作
    双向链表的插入操作
    双向链表的结构
    双向链表的删除操作
    双向链表循环
    OD使用教程17 调试篇17
    OD使用教程17 调试篇17
    双向链表的结构
    独生子女证办理
  • 原文地址:https://www.cnblogs.com/amazingzoe/p/6391357.html
Copyright © 2011-2022 走看看