【LeetCode】463. Island Perimeter

本文介绍了一种计算二维网格中岛屿周长的方法。该方法通过遍历每个单元格并检查其相邻单元格的状态来确定岛屿的边界,从而计算出岛屿的总周长。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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:

/**
 * @param {number[][]} grid
 * @return {number}
 */
var islandPerimeter = function(grid) {
    var count = 0;
    for(var i=0;i<grid.length;i++){
        grid[i].push(0);
        grid[i].unshift(0);
    }
    var len=grid[0].length;
    grid.push((new Array(len)).fill(0));
    grid.unshift(new Array(len).fill(0))
    var len1=grid.length;
    var len2=grid[0].length;
    for(var i = 0 ; i < len1 ; i++){
        for(var j = 0 ; j<len2;j++){
            if(grid[i][j]===1){
                var temp=0;
                if(grid[i][j+1]===1){temp++;}
                if(grid[i][j-1]===1){temp++;}
                if(grid[i-1][j]===1){temp++;}
                if(grid[i+1][j]===1){temp++;}
                if(temp==0){count+=4;}
                else if(temp==1){count+=3;}
                else if(temp==2){count+=2;}
                else if(temp==3){count+=1;}
                
            }
        }
    }
    return count;
};


这题主要要多考虑边界值。







评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值