leetcode-200. 岛屿数量-题解

题目描述

• 给你一个由 ‘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

---

题解思路

• 只有 x 轴(横向)和 y 轴(纵向)在一块才算是一个岛屿， 所以我们只要判断每个坐标四个方向位置就能判断是否为一个岛屿，防止重复遍历走过的地方设置为0
• 采用dfs：当我们访问坐标为1时， 岛屿数量+1，坐标设置为0，遍历这个坐标四个方向的坐标并且设置为0；循环递归，直到遍历结束。
• 采用bfs：bfs同理，不过是采用队列的方式；当前坐标为1，改为0；上下左右值为1时，入队；依次循环；

---

代码实现

java代码(dfs)：

 public static int numIslands(char[][] grid) {
        if (grid == null || grid.length == 0) return 0;
        int result = 0;
        int row = grid.length, col = grid[0].length;
        for (int i=0; i<row; i++) {
            for (int j=0; j<col; j++) {
                // 发现岛屿+1
                if (grid[i][j] == '1') result = result+1;
                // 当前岛屿 1 改为 0
                dfs(grid, i, j, row, col);
            }
        }
        return result;
    }

    public static void dfs(char[][] grid, int x, int y, int row, int col) {
        // 1.return 条件
        if (x<0 || y<0 || x>= row || y>=col
                || grid[x][y] == '0') return;
        // 2.设置为0
        grid[x][y] = '0';
        // 3.查找周围
        dfs(grid, x-1, y, row, col);
        dfs(grid, x+1, y, row, col);
        dfs(grid, x, y-1, row, col);
        dfs(grid, x, y+1, row, col);
    }

java代码(bfs)：

 public static int bfs(char[][] grid){
        if (grid == null || grid.length == 0) return 0;
        int result = 0;
        // 0. 建立高，宽
        int row = grid.length, col = grid[0].length;
        // 0. 建立队列
        Queue<Integer[]> q = new LinkedList<Integer[]>();
        // 1. 遍历
        for (int i=0; i<row; i++) {
            for (int j=0; j<col; j++) {
                // 2. 发现岛屿
                if (grid[i][j] == '1') {
                    // 3. 岛屿+1
                    result = result+1;
                    // 4. 当前岛屿 1 改为 0
                    q.add(new Integer[]{i, j});
                    grid[i][j] = '0';
                    //  5. 遍历周围
                    while (q.size() > 0) {
                        Integer[] cur = q.poll();
                        int x=cur[0], y=cur[1];
                        // 四个方向
                        if (x-1 >= 0 && grid[x-1][y] == '1') {
                            grid[x-1][y] = '0';
                            q.add(new Integer[]{x-1, y});
                        }
                        if (x+1 < row && grid[x+1][y] == '1') {
                            grid[x+1][y] = '0';
                            q.add(new Integer[]{x+1, y});
                        }
                        if (y-1 >= 0 && grid[x][y-1] == '1') {
                            grid[x][y-1] = '0';
                            q.add(new Integer[]{x, y-1});
                        }
                        if (y+1 < col && grid[x][y+1] == '1') {
                            grid[x][y+1] = '0';
                            q.add(new Integer[]{x, y+1});
                        }
                    }
                }
            }
        }
        return result;
    }