题目:()
给你一个由 '1'(陆地)和 '0'(水)组成的的二维网格,请你计算网格中岛屿的数量。
岛屿总是被水包围,并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。
此外,你可以假设该网格的四条边均被水包围。
示例 1:
输入:grid = [
["1","1","1","1","0"],
["1","1","0","1","0"],
["1","1","0","0","0"],
["0","0","0","0","0"]
]
输出:1
题解:dfs:就是找'1',如果找到'1'了,就让他的上下左右的1变为0,如果找到'0'了,就return;
注意:在控制台输入的是
1 1 1
0 1 0
1 0 0
1 0 1
这里有一个回车!!!!!!!
调试的时候一定要加,不然nextLine()会直接跳出最后一行。
package test;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
List<List<String>> list = new ArrayList<>();//用一个List将原始数据以字符串存储
String Line = null;
while ((Line = sc.nextLine()).length() != 0) {
/* 1.读取数据 */
String[] b = Line.split(" ");
list.add(Arrays.asList(b));
}
sc.close();
int m = list.size();
int n = list.get(0).size();
char[][] matrix = new char[m][n];
//将字符串变为int类型
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
String a = list.get(i).get(j);
char b = a.toCharArray()[0];
matrix[i][j] = b;
}
}
int a = numIslands(matrix);
}
public static int numIslands(char[][] grid) {
if (grid == null || grid.length == 0) {
return 0;
}
int nr = grid.length;
int nc = grid[0].length;
int num_islands = 0;
for (int r = 0; r < nr; r++) {
for (int c = 0; c < nc; c++) {
if (grid[r][c] == '1') {
num_islands++;
dfs(grid, r, c);//grid变了
}
}
}
return num_islands;
}
public static void dfs(char[][] grid, int r, int c) {
int nr = grid.length;
int nc = grid[0].length;
if (r < 0 || c < 0 || r >= nr || c >= nc || grid[r][c] == '0') {
return;
}
grid[r][c] = '0';
dfs(grid, r - 1, c);
dfs(grid, r + 1, c);
dfs(grid, r, c - 1);
dfs(grid, r, c + 1);
}
}