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:

    [[0,1,0,0],
     [1,1,1,0],
     [0,1,0,0],
     [1,1,0,0]]
    
    Answer: 16


    求岛的周长

    C++(196ms):
     1 class Solution {
     2 public:
     3     int islandPerimeter(vector<vector<int>>& grid) {
     4         int count = 0 ;
     5         int repeat = 0 ;
     6         for(int i = 0 ; i < grid.size() ; i++){
     7             for(int j = 0 ; j < grid[0].size() ; j++){
     8                 if (grid[i][j] == 1){
     9                     count++ ;
    10                     if (i!=0 && grid[i-1][j] == 1)
    11                         repeat++ ;
    12                     if (j!=0 && grid[i][j-1] == 1)
    13                         repeat++ ;
    14                 }
    15             }
    16         }
    17         return count*4-repeat*2 ;
    18     }
    19 };

    java(153ms):

     1 class Solution {
     2     public int islandPerimeter(int[][] grid) {
     3         int res = 0 ;
     4         for (int i = 0 ; i  < grid.length ; i++){
     5             for (int j = 0 ; j < grid[0].length ; j++){
     6                 if (grid[i][j] == 1){
     7                     res += 4 ;
     8                     if (i!=0 && grid[i-1][j] == 1)
     9                         res -= 2 ;
    10                     if (j!=0 && grid[i][j-1] == 1)
    11                         res -= 2 ;
    12                 }
    13             }
    14         }
    15         return res ;
    16     }
    17 }
  • 相关阅读:
    第二周总结
    第一次结组作业概述
    Spring_Bean的自动装配
    Spring_依赖注入
    Spring_配置
    第一周总结
    1680. Concatenation of Consecutive Binary Numbers
    1631. Path With Minimum Effort
    1657. Determine if Two Strings Are Close
    1673. Find the Most Competitive Subsequence
  • 原文地址:https://www.cnblogs.com/mengchunchen/p/7753267.html
Copyright © 2011-2022 走看看