LeetCode: Number of Islands

最新推荐文章于 2019-07-03 16:50:00 发布

Kent-

最新推荐文章于 2019-07-03 16:50:00 发布

阅读量254

点赞数

分类专栏： LeetCode 算法文章标签： LeetCode 算法 DFS

本文链接：https://blog.csdn.net/liucan9035/article/details/73729578

版权

算法同时被 2 个专栏收录

28 篇文章 0 订阅

订阅专栏

LeetCode

27 篇文章 0 订阅

订阅专栏

题目描述：

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:

Answer: 1

Example 2:

Answer: 3

解题分析:

对于一个01矩阵A，求其中有多少片连成一片的1. 每个1可以和上下左右的1相连. 本地可以使用深度优先搜索求解，遍历所有顶点，对每个值为1的顶点进行DFS，访问时把该顶点值设为0；

代码如下：

class Solution{
public:
 int numIslands(vector<vector<char> >& grid){
   if(grid.size()==0) return 0;
        int count=0;
        for(int i=0;i<grid.size();i++){
         for(int j=0;j<grid[0].size();j++){
          if(grid[i][j] == '1'){
           dfs(grid, i, j);
           count++;
          }
         }
        }
        return count;
    }
    void dfs(vector<vector<char> >& grid, int i, int j){
     if(i<0 || j<0 || i>=grid.size() || j>=grid[0].size() || grid[i][j]!='1') return;
     grid[i][j] = '0'; //相当于标记为已访问
     dfs(grid,i+1,j);
     dfs(grid,i-1,j);
     dfs(grid,i,j+1);
     dfs(grid,i,j-1);
    }
};