dfs import java.util.*; public class Solution { /** * 判断岛屿数量 * @param grid char字符型二维数组 * @return int整型 */ private int[][] dir = new int[][]{{0, -1}, {0, 1}, {-1, 0}, {1, 0}}; public void dfs(char[][] grid, int i, int j, int n, int m) { grid[i][j] = '0'; for (int k = 0; k < 4; k++) { int x = i + d...