week1

Island Perimeter （from leetcode）

---

题意

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.

大致就是求一个内外不连通的岛的周长。

思路

对任意一块非边界岛屿，均判断其上下左右是否邻海，若邻海则周长+1.对于边界岛屿，其邻近边界的一条边算入周长，其他边继续判断。直到扫描所有岛屿与海为止。

代码块

class Solution {
public:
    int islandPerimeter(vector<vector<int>>& grid) {
        int x = 0,y = 0,c = 0;
        y = grid[0].size();
        x = grid.size();

        for(int i = 0; i < x; ++i)
        {
            for(int j = 0; j < y; ++j)
            {
                if(grid[i][j] == 1)
                {
                    if(j == 0 || grid[i][j-1] == 0)
                    {
                        ++c;
                    }
                    if(j == y-1 || grid[i][j+1] == 0)
                    {
                        ++c;
                    }
                    if(i == 0 || grid[i-1][j] == 0)
                    {
                        ++c;
                    }
                    if(i == x-1 || grid[i+1][j] == 0)
                    {
                        ++c;
                    }
                }
            }
        }
        return c;
    }
};