200. Number of Islands

最新推荐文章于 2021-06-18 13:54:55 发布

SnailRunFast

最新推荐文章于 2021-06-18 13:54:55 发布

阅读量210

点赞数 1

分类专栏： Leet Code

本文链接：https://blog.csdn.net/snailrunfast/article/details/86629225

版权

Leet Code 专栏收录该内容

143 篇文章 0 订阅

订阅专栏

200. Number of Islands

Medium

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

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