[leetcode] 200. Number of Islands

Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.

Example 1:

11110
11010
11000
00000

Answer: 1

Example 2:

11000
11000
00100
00011

Answer: 3

解法一：

DFS跑过每一个连通域，然后找下一个没有被visit和grid值为1的位置。

class Solution {public:    int numIslands(vector<vector<char>>& grid) {        int m = grid.size();        int n = grid.empty()?0:grid[0].size();                vector<vector<bool>> visit(m,vector<bool>(n,false));        int res = 0;                for(int i=0; i<m; i++){            for(int j=0; j<n; j++){                if(grid[i][j]=='1' && visit[i][j]==false){                    numsIslandsDFS(grid, visit, i,j);                    res++;                }            }        }        return res;    }        void numsIslandsDFS(vector<vector<char>>& grid, vector<vector<bool>>& visit, int i, int j){        if(i<0 || i>=grid.size()) return;        if(j<0 || j>=grid[0].size()) return;        if(grid[i][j] != '1' || visit[i][j]== true) return;         visit[i][j] = true;                numsIslandsDFS(grid, visit, i-1, j);        numsIslandsDFS(grid, visit, i+1, j);        numsIslandsDFS(grid, visit, i, j-1);        numsIslandsDFS(grid, visit, i, j+1);    }};