日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

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

编程问答

LeetCode之Island Perimeter

發布時間:2023/12/4 编程问答 34 豆豆
生活随笔 收集整理的這篇文章主要介紹了 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的全部內容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。