Number of Islands

原创 2016年08月30日 12:47:27

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

Credits:

Special thanks to @mithmatt for adding this problem and creating all test cases.

思路:就是遍历每一个1的点,做dfs,然后把所有相邻的点全部变成不为1的点,这样count出来也就是做几次dfs了,就有几个island。

public class Solution { 
    public int numIslands(char[][] grid) { 
        if(grid == null || grid.length == 0) return 0; 
        int m = grid.length; 
        int n = grid[0].length; 
        int count = 0; 
        for(int i=0; i<m; i++){ 
            for(int j=0; j<n; j++){ 
                if(grid[i][j] == '1'){ 
                    count++; 
                    dfs(grid, i, j); 
                } 
            } 
        } 
        return count; 
    } 
      
    public void dfs(char[][] grid, int i, int j){ 
        if(i<0 || i>=grid.length || j<0 || j>=grid[0].length || grid[i][j] == '0'){ 
            return; 
        } 
        if(grid[i][j] == '1'){ 
            grid[i][j] = '2'; 
            dfs(grid, i-1, j); 
            dfs(grid, i+1, j); 
            dfs(grid, i, j-1); 
            dfs(grid, i, j+1); 
        } 
    } 
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

【LeetCode-面试算法经典-Java实现】【200-Number of Islands(岛的数目)】

【200-Number of Islands(岛的数目)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】代码下载【https://github.com/Wang-Jun-Chao...

LeetCode 200. Number of Islands (并查集)

LeetCode 200. Number of Islands (并查集)LeetCode 200 Number of Islands 并查集 问题描述 解题思路 参考代码Tags: * Depth...

第三周:( LeetCode200 ) Number of Islands(c++)

原题:本题是经典的简单图论问题,求岛的个数也即求图上的连通区间的个数。可采用深搜或者广搜。假设共有n个点,时间复杂度为o(n)。本题笔者采用深搜的递归和非递归两种解法。将遍历过的“1”被改为“0”,其...

LeetCode 200. Number of Islands

DFS遍历即可。

leetcode解题之200. Number of Islands Java版(岛屿的数量)

leetcode解题之200. Number of Islands Java版(岛屿的数量) ,深度优先遍历

<LeetCode OJ> 200 / 130 Number of Islands / Surrounded Regions

Total Accepted: 48411 Total Submissions: 171609 Difficulty: Medium Given a 2d grid map of '1's ...

[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 sur...

leetcode Add to List 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 surr...

Leetcode-200. Number of Islands

前言:为了后续的实习面试,开始疯狂刷题,非常欢迎志同道合的朋友一起交流。因为时间比较紧张,目前的规划是先过一遍,写出能想到的最优算法,第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发CSDN...
  • mcf171
  • mcf171
  • 2016年12月30日 21:11
  • 117

LeetCodeOJ_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 surro...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Number of Islands
举报原因:
原因补充:

(最多只允许输入30个字)