This is the java solution for the Leetcode problem – Island Perimeter – Leetcode Challenge – Java Solution.
Source – qiyuangong’s repository.
x
16
16
1
class Solution {2
public int islandPerimeter(int[][] grid) {3
// https://leetcode.com/problems/island-perimeter/discuss/95001/clear-and-easy-java-solution4
int islands = 0, neighbours = 0;5
for (int i = 0; i < grid.length; i++) {6
for (int j = 0; j < grid[i].length; j++) {7
if (grid[i][j] == 1) {8
islands++; // count islands9
if (i < grid.length - 1 && grid[i + 1][j] == 1) neighbours++; // count down neighbours10
if (j < grid[i].length - 1 && grid[i][j + 1] == 1) neighbours++; // count right neighbours11
}12
}13
}14
return islands * 4 - neighbours * 2;15
}16
}