(BFS/DFS) leetcode 200. Number of Islands

时间:2019-04-15
本文章向大家介绍(BFS/DFS) leetcode 200. Number of Islands,主要包括(BFS/DFS) 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:

Input:
11110
11010
11000
00000

Output: 1

Example 2:

Input:
11000
11000
00100
00011

Output: 3
-----------------------------------------------------------------------------------------------------------------------------------------
顾名思义,就是求岛屿的个数,此题可以用bfs,也可以用dfs求解,相对来说,用dfs写代码会更简单,但是这个题我用bfs。
这个题用bfs时,不必新设立vis来判断是否访问过,可以把访问到的‘1’的字符中,把这个字符改为'0'就可以。
 
C++代码:
class Solution {
public:
    int numIslands(vector<vector<char>>& grid) {
        typedef pair<int,int> pii;
        queue<pii> q;
        int x = 0,y = 0,xx = 0,yy = 0;
        int dx[] = {1,-1,0,0};
        int dy[] = {0,0,1,-1};
        int row = grid.size();
        int col;
        int sum = 0;
        if(row > 0){
            col = grid[0].size();
        }
        else{
            col = 0;
        }
        if(row == 0 || col == 0){
            return 0;
        }
        for(int i = 0; i < row; i++){
            for(int j = 0; j < col; j++){
                if(grid[i][j] == '1'){
                    grid[i][j] == '0';
                    q.push(pii(i,j));
                    while(!q.empty()){
                        x = q.front().first;
                        y = q.front().second;
                        q.pop();
                        for(int i = 0; i < 4; i++){
                            xx = x + dx[i];
                            yy = y + dy[i];
                            if(xx >= 0 && xx < row && yy >= 0 && yy < col && grid[xx][yy] == '1'){
                                grid[xx][yy] = '0';
                                q.push(pii(xx,yy));
                            }
                        }
                    }
                    sum++;
                }
            }
        }
        return sum;
    }
};

 

 

上一页 下一页

原文地址:http://www.manongjc.com/article/103536.html