图论算法之深度遍历岛屿问题
200. 岛屿数量 - 力扣(LeetCode)
class Solution {public int numIslands(char[][] grid) {int res 0;for(int r 0; r< grid.length; r){for(int c 0; c<grid[0].length; c){if(grid[r][c] 1){res;dfs(grid, r,c);}}}return res;}//从岛屿位置…
2026/7/6 3:09:06