欢迎访问 生活随笔!

生活随笔

当前位置: 首页 > 编程资源 > 编程问答 >内容正文

编程问答

LeetCode之Island Perimeter

发布时间:2023/12/4 编程问答 46 豆豆
生活随笔 收集整理的这篇文章主要介绍了 LeetCode之Island Perimeter 小编觉得挺不错的,现在分享给大家,帮大家做个参考.

1、题目

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:


2、代码实现

public class Solution {public int islandPerimeter(int[][] grid) {if (grid == null)return 0;//gril.length就是行数 row,grid.length就是列数grilint row = grid.length;int col = grid[0].length;int sum = 0, count = 0;for (int i = 0; i < row; ++i) {for (int j = 0; j < col; ++j) {if (grid[i][j] == 1) {if (i - 1 == -1) {count++;} else {if (grid[i - 1][j] == 0) {count++;}}if (i + 1 == row) {count++;} else {if (grid[i + 1][j] == 0) {count++;}}if (j - 1 == -1) {count++;} else {if (grid[i][j - 1] == 0) {count++;}}if (j + 1 == col) {count++;} else {if (grid[i][j + 1] == 0) {count++;}}}}}return count; } }
 

 

总结

以上是生活随笔为你收集整理的LeetCode之Island Perimeter的全部内容,希望文章能够帮你解决所遇到的问题。

如果觉得生活随笔网站内容还不错,欢迎将生活随笔推荐给好友。