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

    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:
    

    class Solution {
    public:
        int islandPerimeter(vector<vector<int>>& grid) {
            int row=grid.size(), col=grid[0].size(), sum=0;
            for(int i=0; i<row; i++)
                for(int j=0; j<col; j++)
                    if(grid[i][j]==1){
                        if(i-1<0||grid[i-1][j]==0)
                           sum++;
                        if(i+1>row-1||grid[i+1][j]==0)
                           sum++;
                        if(j-1<0||grid[i][j-1]==0)
                           sum++;
                        if(j+1>col-1||grid[i][j+1]==0)
                           sum++;
                    }
             return sum;
        }
    };
    
  • 相关阅读:
    [MySql]insert...select 8/10
    秀出Administrator帳戶6/27
    Love
    讀取Gridview的隱藏欄8/22
    水晶報表公式換行8/2
    MySql.Data.MySqlClient.MySqlException 7/9
    mysql的錯誤日誌爆满7/24
    从汇编看c++中的const常量
    可见性和生命期的区别
    比较烦
  • 原文地址:https://www.cnblogs.com/A-Little-Nut/p/10067344.html
Copyright © 2011-2022 走看看