463. Island Perimeter
class Solution { static int sum = 0; public int islandPerimeter(int[][] grid) { sum = 0; for(int i = 0; i < grid.length; i ++) for(int j = 0; j < grid[0].length; j ++) { if(grid[i][j] == 1) { dfs(grid, i, j); break; } } // System.out.println(sum); return sum; } public void dfs(int [][] grid, int i, int j) { if(i < 0 || j < 0 || i >= grid.length || j >= grid[0].length || grid[i][j] == 0) { sum++; return; } if(grid[i][j] == -1) return; grid[i][j] = -1; dfs(grid, i + 1, j); d...
463. Island Perimeter
class Solution { static int sum = 0; public int islandPerimeter(int[][] grid) { sum = 0; for(int i = 0; i < grid.length; i ++) for(int j = 0; j < grid[0].length; j ++) { if(grid[i][j] == 1) { dfs(grid, i, j); break; } } // System.out.println(sum); return sum; } public void dfs(int [][] grid, int i, int j) { if(i < 0 || j < 0 || i >= grid.length || j >= grid[0].length || grid[i][j] == 0) { sum++; return; } if(grid[i][j] == -1) return; grid[i][j] = -1; dfs(grid, i + 1, j); d...
