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:
    

    参考的大牛的思路:

    1. find how many 1 in the map. If without the consideration of surrounding cells, the total perimeter should be the total amount of 1 times 4.
    2. find how many cell walls that connect with both lands. We need to deduct twice of those lines from total perimeter
    int islandPerimeter(vector<vector<int>>& grid)
         {
             int count = 0, repeat = 0;
             for (int i = 0; i < grid.size(); i++)
             {
                 for (int j = 0; j < grid[i].size(); j++)
                 {
                     if (grid[i][j] == 1)
                     {
                         count++;
                         if (i != 0 && grid[i - 1][j] == 1) repeat++;
                         if (j != 0 && grid[i][j - 1] == 1) repeat++;
                     }
                 }
             }
             return 4 * count - repeat * 2;
         }

    参考:

    https://discuss.leetcode.com/topic/68845/c-solution-with-explanation

  • 相关阅读:
    你写的单例真的安全吗?
    CountDownLatch&&CyclicBarrier
    初步认识AQS
    Atomic底层原理
    volatile关键字
    Linux常用服务类相关命令
    线程池
    由浅入深TheradLocal
    synchronized关键字
    .net 中dapper实现事务的三种方式总结
  • 原文地址:https://www.cnblogs.com/hellowooorld/p/6842902.html
Copyright © 2011-2022 走看看