【深度优先】岛屿数量

200.岛屿数量

• 来源：https://leetcode.cn/problems/number-of-islands

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

思路：

使用深度优先或广度优先遍历数组来划分岛屿：

1. 遍历数组，如果当前值为“2”或“0”说明当前位置的岛屿已经标记过了或当前位置是水。
2. 否则：进行DFS或BFS遍历，对同一个岛屿的值赋为“2”，并将岛屿数加1。

（这里用了DFS）

class Solution {
public:
    void DFS(vector<vector<char>>& grid, int r, int l) {
        if(r == -1 || l == -1 || l == grid[0].size() || r == grid.size() || grid[r][l] == '0') return;
        if(grid[r][l] == '1') {
            grid[r][l] = '2';
            DFS(grid,r+1,l);
            DFS(grid,r,l+1);
            DFS(grid,r-1,l);
            DFS(grid,r,l-1);
        }
    }
    int numIslands(vector<vector<char>>& grid) {
        int sum = 0;
        for(int i = 0; i<grid.size(); i++)
        {
            for(int j = 0; j<grid[0].size(); j++)
            {
                if(grid[i][j] != '2' && grid[i][j] != '0') {
                     DFS(grid, i, j);
                     sum ++;
                }
                   
            }
        }
        return sum;
    }
};