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

    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:
    
    

    loop over the matrix and count the number of islands;
    if the current dot is an island, count if it has any right neighbour or down neighbour;
    the result is islands * 4 - neighbours * 2

    时间:O(N^2),空间:O(1)

    class Solution {
        public int islandPerimeter(int[][] grid) {
            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(j + 1 < grid[0].length && grid[i][j+1] == 1)
                            neighbors++;
                        if(i + 1 < grid.length && grid[i+1][j] == 1)
                            neighbors++;
                    }
                }
            }
            return islands * 4 - neighbors * 2;
        }
    }
  • 相关阅读:
    句子
    Https
    SSH
    uCMDB
    snapshot与release
    Ansible
    .NET core webApi 使用JWT验证签名(转)
    .NET core 使用Swagger(转)
    微服务的4个设计原则和19个解决方案(转)
    .NET Core 使用RabbitMQ(转)
  • 原文地址:https://www.cnblogs.com/fatttcat/p/10049466.html
Copyright © 2011-2022 走看看