本文介绍: 遍历所有值为1的节点,若周围节点是水或边界,则周长+1。

一、题目

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>>&amp; 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;
    }
};

原文地址:https://blog.csdn.net/weixin_46841376/article/details/134763295

本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任

如若转载,请注明出处:http://www.7code.cn/show_49972.html

如若内容造成侵权/违法违规/事实不符,请联系代码007邮箱suwngjj01@126.com进行投诉反馈,一经查实,立即删除

发表回复

您的邮箱地址不会被公开。 必填项已用 * 标注