LeetCode 200. Number of Islands（dfs）

题目来源：https://leetcode.com/problems/number-of-islands/

问题描述

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

------------------------------------------------------------

题意

给定由0和1组成的二维数组，0表示水域，1表示陆地，求岛屿的个数

------------------------------------------------------------

思路

遍历所有1的单元格，对于每个是1的单元格，dfs遍历这个单元格所在岛屿的每块陆地单元格并将其由1变0（防止重复统计）

------------------------------------------------------------

代码

class Solution {
    private int cnt = 0;
    
    private void dfs(char[][] grid, int x, int y) {
        grid[x][y] = '0';
        if (x > 0 && grid[x-1][y] == '1') {
            dfs(grid, x-1, y);
        }
        if (x < grid.length-1 && grid[x+1][y] == '1') {
            dfs(grid, x+1, y);
        }
        if (y > 0 && grid[x][y-1] == '1') {
            dfs(grid, x, y-1);
        }
        if (y < grid[0].length-1 && grid[x][y+1] == '1') {
            dfs(grid, x, y+1);
        }
    }
    
    public int numIslands(char[][] grid) {
        int m = grid.length;
        if (m == 0) {
            return 0;
        }
        int x = 0, y = 0, n = grid[0].length;
        if (n == 0) {
            return 0;
        }
        for (x=0; x<m; ++x) {
            for (y=0; y<n; ++y) {
                if (grid[x][y] == '1') {
                    dfs(grid, x, y);
                    ++cnt;
                }
            }
        }
        return cnt;
    }
}