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

    class Solution {
    public:
        int islandPerimeter(vector<vector<int>>& grid) {
            int ret=0;
            int row=grid.size(),col=grid[0].size();
            for(int i=0;i<row;i++)
                for(int j=0;j<col;j++)
                {
                    if(grid[i][j]==0)
                    continue;
                    if(i==0||grid[i-1][j]==0)ret++;
                    if(i==row-1||grid[i+1][j]==0) ret++;
                    if(j==0||grid[i][j-1]==0) ret++;
                    if(j==col-1||grid[i][j+1]==0) ret++;
                }
            return ret;
        }
    };
    
  • 相关阅读:
    前台线程与后台线程的区别
    触发器
    Asp.net AutopostBack 属性
    Spring实战拆书--SpringBean
    侣行APP
    用android去写一个小程序
    java如何使用JUnit进行单元测试
    JDK的安装与配置以及eclipse的使用
    软件工程第一次作业(1)
    软件工程第一次作业(2)
  • 原文地址:https://www.cnblogs.com/fengxw/p/6184527.html
Copyright © 2011-2022 走看看