思路:
一旦遇到岛,result先加4,然后依次判断其右边和下边相邻的是不是岛,若是,则result减2。
public class Solution {
public int islandPerimeter(int[][] grid) {
int rows = grid.length;
int cols = grid[0].length;
int result = 0;
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
if (grid[i][j] == 1) {
result += 4;
if (j < cols - 1 && grid[i][j + 1] == 1)
result -= 2;
if (i < rows - 1 && grid[i + 1][j] == 1)
result -= 2;
}
}
}
return result;
}
}
Runtime:128ms