leetcode 463 Island Perimeter
z
 2019-06-10 21:00:35  

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:

1
2
3
4
5
6
7
8
9
Input:
[[0,1,0,0],
 [1,1,1,0],
 [0,1,0,0],
 [1,1,0,0]]

Output: 16

Explanation: The perimeter is the 16 yellow stripes in the image below:

最简单的答案：遍历matrix，一次判断当前cell和他四周的cell之间的关系。

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
class Solution(object):
    def islandPerimeter(self, grid):
        """
        :type grid: List[List[int]]
        :rtype: int
        """
        m = len(grid)
        n = len(grid[0])
        perimeter = 0
        for i in range(m):
            for j in range(n):
                if grid[i][j]:
                    if i==0:
                        perimeter += 1
                    if j==0:
                        perimeter += 1
                    if i==m-1:
                        perimeter += 1
                    if j==n-1:
                        perimeter += 1
                    
                    if i-1>=0 and not grid[i-1][j]:
                        perimeter += 1
                    if i+1<m and not grid[i+1][j]:
                        perimeter += 1
                    if j-1>=0 and not grid[i][j-1]:
                        perimeter += 1
                    if j+1<n and not grid[i][j+1]:
                        perimeter += 1
        return perimeter
  • More Concise
1
2
3
4
5
6
7
8
9
10
11
12
13
14
class Solution:
    def islandPerimeter(self, grid):
        if not grid:
            return 0

        N = len(grid)
        M = len(grid[0])
        ans = 0
        for i in range(N):
            for j in range(M):
                for k in [(-1, 0), (0, 1), (1, 0), (0, -1)]:
                    if i+k[0] < 0 or i + k[0] >= N or j+k[1] < 0 or j+k[1] >= M or grid[i+k[0]][j+k[1]] == 0:
                        ans += 1
        return ans