Leetcode.0200 | 岛屿数量

题目

给你一个由 '1'（陆地）和 '0'（水）组成的的二维网格，请你计算网格中岛屿的数量。

岛屿总是被水包围，并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。

此外，你可以假设该网格的四条边均被水包围。

示例

输入：grid = [
  ["1","1","1","1","0"],
  ["1","1","0","1","0"],
  ["1","1","0","0","0"],
  ["0","0","0","0","0"]
]
输出：1

输入：grid = [
  ["1","1","0","0","0"],
  ["1","1","0","0","0"],
  ["0","0","1","0","0"],
  ["0","0","0","1","1"]
]
输出：3

解决方法

采用深度优先搜索的方式，首先对二维数组进行遍历，找到进行dfs的开始入口。当遇到值为‘1’的位置时，以此为开始进行深度优先搜索。在dfs的过程中，每次遇到一个值为'1'的位置，就将其值修改为‘0’以避免重复查找。一个岛所有的‘1’都变成了‘0’后，遍历的时候就不会重复遍历了。

代码实现

class Solution {
public:
    void dfs(vector<vector<char>>& grid,int i,int j){
        if(i<0 || i>=grid.size() || j<0 || j>=grid[0].size() || grid[i][j] != '1')   return; //到达递归边界。
        grid[i][j] = '0';
        dfs(grid,i+1,j);
        dfs(grid,i-1,j);
        dfs(grid,i,j-1);
        dfs(grid,i,j+1);
    }
    int numIslands(vector<vector<char>>& grid) {
        int count = 0;
        for(int i = 0;i < grid.size();i ++){
            for(int j = 0;j < grid[0].size();j ++){
                if(grid[i][j] == '1'){
                    //寻找到执行一轮dfs的开始位置
                    dfs(grid,i,j);
                    //一轮dfs结束后，整个岛屿区域都被查到，结果加1
                    count ++;
                }
            }
        }
        return count;
    }
};