n*m的网格,有一个新冠患者,他的上下左右都会被传染,如果有4个医护人员站在上下左右,就可以阻止新冠传播。这时有x个患者,需要多少个医护人员来阻止传播呢?
思路:就是把新冠阳性设为1,阴性设为0,求1周围有多少个0,0不能重复。
遍历一次二维数组,grid[i][j] == 1 的上下左右如果是0,就将其设为2,表示已经知道这里是患者或密接了,并且sum++记录需要多少个医护人员
public class Ncov19Defect {
public static void main(String[] args) {
int[][] grid = {
{0, 1, 0, 0, 0, 0, 0, 1},
{0, 1, 0, 0, 0, 0, 0, 1},
{0, 0, 0, 0, 0, 0, 0, 1},
{0, 0, 0, 0, 0, 0, 0, 0}
};
ncov19Defect(grid);
System.out.println(sum);
}
private static int sum = 0;
private static void ncov19Defect(int[][] grid) {
sum = 0;
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[0].length; j++) {
if (grid[i][j] == 1) {
dfs(grid, i, j);
}
}
}
}
private static int[][] dir = new int[][]{
{1, 0},
{-1, 0},
{0, 1},
{0, -1}
};
private static void dfs(int[][] grid, int i, int j) {
grid[i][j] = 2;
for (int k = 0; k < 4; ++k) {
int xx = i + dir[k][0];
int yy = j + dir[k][1];
if (xx >= 0 && xx < grid.length && yy >= 0 && yy < grid[0].length) {
if (grid[xx][yy] == 1) {
dfs(grid, xx, yy);
} else if (grid[xx][yy] == 0) {
grid[xx][yy] = 2;
sum++;
}
}
}
}
}