Leetcode-200. 岛屿数量（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

示例 2：

输入：grid = [
  ["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'

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/number-of-islands
 

class Solution {
    public int numIslands(char[][] grid) {
        int islandNum = 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);
                    islandNum++;
                }
            }
        }
        return islandNum;
    }

    public void dfs(char[][] grid,int i, int j)
    {
        if(i < 0 || i >= grid.length ||j < 0 || j >= grid[0].length || grid[i][j] != '1') 
        {
            return;    //越界判断
        }

        grid[i][j]= '2';        //防止重复遍历
        dfs(grid, i + 1, j);    //下移
        dfs(grid, i - 1, j);    //上移
        dfs(grid, i, j + 1);    //右移
        dfs(grid, i, j - 1);    //左移
    }

    public final int[] moveX = {-1, 0, 1, 0};
    public final int[] moveY = {0, 1, 0, -1};

    public void dfs2(char[][] grid,int i, int j)
    {
        if(i < 0 || i >= grid.length ||j < 0 || j >= grid[0].length || grid[i][j] != '1')
        {
            return;
        }

        grid[i][j]= 'X';
        for (int k = 0; k < 4; k++) {
            int x = i + moveX[k];
            int y = j + moveY[k];
            dfs2(grid, x, y);
        }
    }
}