岛屿的数量（Java实现）

给你一个由 '1'（陆地）和 '0'（水）组成的的二维网格，请你计算网格中岛屿的数量。
岛屿总是被水包围，并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。
此外，你可以假设该网格的四条边均被水包围。

示例 1：
输入：grid = [
  ["1","1","1","1","0"],
  ["1","1","0","1","0"],
  ["1","1","0","0","0"],
  ["0","0","0","0","0"]
]
----------------------------------
1 1 1 1 0
1 1 0 1 0
1 1 0 0 0
0 0 0 0 0
----------------------------------
输出：1
示例 2：
输入：grid = [
  ["1","1","0","0","0"],
  ["1","1","0","0","0"],
  ["0","0","1","0","0"],
  ["0","0","0","1","1"]
]
----------------------------------
1 1 0 0 0
1 1 0 0 0
0 0 1 0 0
0 0 0 1 1
----------------------------------
输出：3
提示：
m == grid.length
n == grid[i].length
1 <= m, n <= 300
grid[i][j] 的值为 '0' 或 '1'

实现代码如下：

import java.util.Scanner;

public class IslandNum {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while(scanner.hasNext()) {
            int m = scanner.nextInt();
            int n = scanner.nextInt();
            int[][] islands = new int[m][n];
            for (int i = 0; i < m; i++) {
                for (int j = 0; j < n; j++) {
                    islands[i][j] = scanner.nextInt();
                }
            }
            int count = 0;
            for (int i = 0; i < m; i++) {
                for (int j = 0; j < n; j++) {
                    if (islands[i][j] != 1) {
                        continue;
                    }
                    count++;
                    findIsland(islands, i, j);
                }
            }
            System.out.println("岛屿数量：" + count);
        }
    }

    private static void findIsland(int[][] islands, int r, int c) {
        if (!inArea(islands, r, c)) {
            return;
        }
        if (islands[r][c] != 1) {
            return;
        }
        islands[r][c] = 2;
        findIsland(islands, r + 1, c);
        findIsland(islands, r - 1, c);
        findIsland(islands, r, c + 1);
        findIsland(islands, r, c - 1);
    }

    private static boolean inArea(int[][] islands, int r, int c) {
        return r >= 0 && r < islands.length && c >=0 && c < islands[0].length;
    }

}