200. Number of Islands

Posted 2020-07-23 蜃利的阴影下

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.

 

Subscribe to see which companies asked this question

Hide Tags

 Depth-first Search Breadth-first Search Union Find

Hide Similar Problems

 (M) Surrounded Regions (M) Walls and Gates (H) Number of Islands II (M) Number of Connected Components in an Undirected Graph

 

 

public class Solution {
    int R = -1;
    int C = -1;
    public int numIslands(char[][] grid) {
        R = grid.length;
        if(R == 0)
            return 0;
            
        C = grid[0].length;
        
        int count = 0;
        for(int r = 0; r<R; ++r)
        {
            for(int c = 0; c<C; ++c)
            {
                if(grid[r][c] == ‘1‘)
                {
                    ++count;
                }
                changeIslandsToWater(grid, r, c);
            }
            
        }
        return count;
    }
    
    private void changeIslandsToWater(char[][] grid, int r, int c)
    {
        if(r>=R || c >=C || r<0 || c<0)
            return;
        if(grid[r][c] == ‘0‘)
            return;
        
        grid[r][c] = ‘0‘;
        changeIslandsToWater(grid, r, c+1); //go right
        changeIslandsToWater(grid, r+1, c); //go down
        changeIslandsToWater(grid, r, c-1); //go left
        changeIslandsToWater(grid, r-1, c); //go up
        
    }
}