使用图论里面的dfs解决岛屿问题

参见leetcode 200题

解题思路：碰到陆地，通过dfs将相邻的陆地置为水域,最后找到岛屿数量

class Solution {
    public int numIslands(char[][] grid) {
        int result = 0;
        int row = grid.length;
        int col = grid[0].length;
        for(int i = 0; i < row; i++){
            for(int j = 0; j < col; j++){
                if(grid[i][j] == '1'){
                    result++;
                    dfs(grid, i, j, row, col);
                }
            }
        }

        return result;
    }

    public void dfs(char[][] grid, int i, int j, int row, int col){
        if(i < 0 || j < 0 || i >= row || j >= col || grid[i][j] == '0'){
            return;
        }

        grid[i][j] = '0';
        dfs(grid, i - 1, j, row, col);
        dfs(grid, i, j - 1, row, col);
        dfs(grid, i, j + 1, row, col);
        dfs(grid, i + 1, j, row, col);
    }
}