高频leetcode深搜部分：200. 岛屿数量

200. 岛屿数量

难度中等1538
给你一个由 ‘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’

思路

• 深搜，从起点向上下左右四个方向寻找

*代码

class Solution {
public:

    void dfs(vector<vector<char>>& grid,int l,int c){//改变grid的值，经过就置0
        int m=grid.size();
        int n=grid[0].size();
        
        grid[l][c]='0';//先置0,再移动，防止重复
        if(l+1<m&&grid[l+1][c]=='1')    dfs(grid,l+1,c);
        if(l-1>=0&&grid[l-1][c]=='1')    dfs(grid,l-1,c);
        if(c+1<n&&grid[l][c+1]=='1')    dfs(grid,l,c+1);
        if(c-1>=0&&grid[l][c-1]=='1')    dfs(grid,l,c-1);
        
    }
    int numIslands(vector<vector<char>>& grid) {
        int i,j,numIslands=0;
        int m=grid.size();
        int n=grid[0].size();
        for(i=0;i<m;i++)
            for(j=0;j<n;j++)
                if(grid[i][j]=='1')
                {
                    numIslands++;
                    dfs(grid,i,j);
                }
        return numIslands;
    }
};