LeetCode463. Island Perimeter

本文主要是介绍LeetCode463. Island Perimeter，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

一、题目

You are given row x col grid representing a map where grid[i][j] = 1 represents land and grid[i][j] = 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”, meaning the water inside 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:

Input: grid = [[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 above.
Example 2:

Input: grid = [[1]]
Output: 4
Example 3:

Input: grid = [[1,0]]
Output: 4

Constraints:

row == grid.length
col == grid[i].length
1 <= row, col <= 100
grid[i][j] is 0 or 1.
There is exactly one island in grid.

二、题解

遍历所有值为1的节点，若周围节点是水或边界，则周长+1。

class Solution {
public:int islandPerimeter(vector<vector<int>>& grid) {int dirs[4][2] = {1,0,0,1,-1,0,0,-1};int m = grid.size(),n = grid[0].size();int res = 0;for(int i = 0;i < m;i++){for(int j = 0;j < n;j++){if(grid[i][j] == 1){for(int k = 0;k < 4;k++){int x = i + dirs[k][0];int y = j + dirs[k][1];if(x < 0 || x >= m || y < 0 || y >= n || grid[x][y] == 0) res++;}   }}}return res;}
};

这篇关于LeetCode463. Island Perimeter的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---