20190421-Leetcode-200.岛屿的个数

Leetcode-200.岛屿的个数

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

示例 2:
输入:
11000
11000
00100
00011
输出: 3
思路：
用mark[x][y]数组表示已经访问过的结点的情况，然后循环遍历二维数组，对二维数组中的数，深度优先搜索或者广度优先搜索遍历，把周围的岛屿的都遍历一遍，并且在mark数组上进行对应的标记。

代码：

class Solution {
public:
    void DFS(vector<vector<char> > &grid, vector<vector<int> > &mark, int x, int y){
        mark[x][y] == 1;
        static const int dx[] = {-1, 1, 0, 0};
        static const int dy[] = {0, 0, -1, 1};
        for(int i = 0; i < 4; i++){
            int newx = x + dx[i];
            int newy = y + dy[i];
            if(newx < 0 ||  newy < 0 || newx >= mark.size() || newy >= mark[newx].size()){
                continue;
            }
            if(grid[newx][newy] == '1' && mark[newx][newy] == 0){
                DFS(grid, mark, newx, newy);
            }
        }
    }
    void BFS(vector<vector<char> > &grid, vector<vector<int> > &mark, int x, int y){
        queue<pair<int, int> > q_res;
        q_res.push(make_pair(x, y));
        mark[x][y] = 1;
        static const int dx[] = {-1, 1, 0, 0};
        static const int dy[] = {0, 0, -1, 1};
        while(!q_res.empty()){
            x = q_res.front().first;
            y = q_res.front().second;
            q_res.pop();
            
            for(int i = 0; i < 4; i++){
                int newx = x + dx[i];
                int newy = y + dy[i];
                if(newx < 0 ||  newy < 0 || newx >= mark.size() || newy >= mark[newx].size()){
                    continue;
                }
                if(grid[newx][newy] == '1' && mark[newx][newy] == 0){
                    q_res.push(make_pair(newx, newy));
                    mark[newx][newy] = 1;
                }
            }
        }
    }
    int numIslands(vector<vector<char>>& grid) {
        vector<vector<int> > mark;
        int island_num = 0;
        for(int i = 0; i < grid.size(); i++){
            mark.push_back(vector<int>(grid[i].size(), 0));
        }
        
        for(int i = 0; i < grid.size(); i++){
            for(int j = 0; j < grid[i].size(); j++){
                if(grid[i][j] == '1' && mark[i][j] == 0){
                    BFS(grid, mark, i , j);
                    // DFS(grid, mark, i , j);
                    island_num++;
                }
            }
        }
        return island_num;
    }
};