LeetCode每天刷day57:Number of Islands

题目:
给定一个由 ‘1’（陆地）和 ‘0’（水）组成的的二维网格，计算岛屿的数量。一个岛被水包围，并且它是通过水平方向或垂直方向上相邻的陆地连接而成的。你可以假设网格的四个边均被水包围。

题目链接:Number of Islands
C++:
DFS:

class Solution {
public:
    int numIslands(vector<vector<char>>& grid) {
        if(grid.empty() || grid[0].empty())
            return 0;
        int m = grid.size();
        int n = grid[0].size();
        int ret = 0;
        vector<vector<bool>> vis(m, vector<bool>(n, false));
        for(int i =0; i < m; i++) {
            for(int j = 0; j < n; j++) {
                if(grid[i][j] == '0' || vis[i][j])
                    continue;
                dfs(grid, vis, i, j);
                ret++;
            }
        }
        return ret;
    }
    void dfs(vector<vector<char>>& grid, vector<vector<bool>>& vis, int x,int y) {
        if(x < 0 || x >= grid.size() || y < 0 || y >= grid[0].size() || grid[x][y] == '0' || vis[x][y])
            return;
        vis[x][y] = true;
        dfs(grid, vis, x-1, y);
        dfs(grid, vis, x+1, y);
        dfs(grid, vis, x, y-1);
        dfs(grid, vis, x, y+1);  
    }
};

BFS:

class Solution {
public:
    int numIslands(vector<vector<char>>& grid) {
        if(grid.empty() || grid[0].empty())
            return 0;
        int m = grid.size();
        int n = grid[0].size();
        int ret = 0;
        vector<vector<bool>> vis(m, vector<bool>(n, false));
        queue<pair<int, int>> q;
        for(int i = 0; i < m; i++){
            for(int j = 0; j < n; j++){
                if(!vis[i][j]){
                    vis[i][j] = true;
                    if(grid[i][j] == '1'){
                        q.push(make_pair(i, j));
                        while(!q.empty()){
                            int mm = q.front().first;
                            int nn = q.front().second;
                            q.pop();
                            
							if (mm < m - 1 && !vis[mm + 1][nn])
							{
								vis[mm + 1][nn] = true;
								if ((grid[mm + 1][nn]) == '1')
									q.push(make_pair(mm + 1, nn));
							}
							if (mm > 0 && !vis[mm - 1][nn])
							{
								vis[mm - 1][nn] = true;
								if ((grid[mm - 1][nn]) == '1')
									q.push(make_pair(mm - 1, nn));
							}
							if (nn < n - 1 && !vis[mm][nn + 1])
							{
								vis[mm][nn + 1] = true;
								if ((grid[mm][nn + 1]) == '1')
									q.push(make_pair(mm, nn + 1));
							}
							if (nn > 0 && !vis[mm][nn - 1])
							{
								vis[mm][nn - 1] = true;
								if ((grid[mm][nn - 1]) == '1')
									q.push(make_pair(mm, nn - 1));
							}
                        }
                        ret++;
                    }
                }
            }
        }
        return ret;
    }
};