import java.util.*;


public class Solution {

    public int solve (char[][] grid) {
        int number = 0;
        for (int i = 0; i < grid.length; i++) {
            for (int j = 0; j < grid[i].length; j++) {
                if (grid[i][j] == '1') {
                    dfs(grid, i, j);
                    number++;
                }
            }
        }
        return number;
    }

    /**
         * 代碼中的類名、方法名、參數(shù)名已經(jīng)指定，請勿修改，直接返回方法規(guī)定的值即可
         *
         * 判斷島嶼數(shù)量
         * @param grid char字符型二維數(shù)組
         * @return int整型
         */
    public void dfs(char[][] grid, int i, int j) {
        // 終止條件
        if (i < 0 || j < 0 || i > grid.length-1 || j > grid[0].length-1 || grid[i][j] == '0') {
            return;
        }
        // 將每一個(gè)遍歷到的島嶼節(jié)點(diǎn)改為 ‘0’
        if (grid[i][j] == '1') {
            grid[i][j] = '0';
        }
        dfs(grid, i - 1, j);
        dfs(grid, i + 1, j);
        dfs(grid, i, j - 1);
        dfs(grid, i, j + 1);
    }
}