Zombie in Matrix

最新推荐文章于 2022-04-25 01:06:31 发布

原创最新推荐文章于 2022-04-25 01:06:31 发布 · 386 阅读

0 ·

CC 4.0 BY-SA版权

算法专栏收录该内容

46 篇文章

订阅专栏

本文介绍了一个基于二维网格的僵尸传染模拟算法。通过遍历地图找到所有僵尸的位置，并使用队列来跟踪感染进度。该算法每天从当前的僵尸位置出发，尝试感染其周围的人类（上、下、左、右），直至所有人类被感染或无法继续感染。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a 2D grid, each cell is either a wall 2, a zombie 1 or people 0 (the number zero, one, two).Zombies can turn the nearest people(up/down/left/right) into zombies every day, but can not through wall. How long will it take to turn all people into zombies? Return -1 if can not turn all people into zombies.

class Coordinate {
    int x;
    int y;
    public Coordinate(int x, int y) {
        this.x = x;
        this.y = y;
    }
}
public class Solution {
    /**
     * @param grid  a 2D integer grid
     * @return an integer
     */
    public int zombie(int[][] grid) {
        if (grid == null || grid.length == 0 || grid[0].length == 0) {
            return -1;
        }
        int n = grid.length;
        int m = grid[0].length;
        int people = 0;
        Queue<Coordinate> queue = new LinkedList<>();
        int[] directionX = {0, 0, 1, -1};
        int[] directionY = {1, -1, 0, 0};
        //找到所有僵尸,统计所有人数
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (grid[i][j] == 1) {
                    queue.offer(new Coordinate(i, j));
                }
                if (grid[i][j] == 0) {
                    people++;
                }
            }
        }
        if (people == 0) {
            return 0;
        }
        int time = 0;
        while (!queue.isEmpty()) {
            int size = queue.size();
            time++;
            //System.out.println("当前是第" + time + "天，还剩" + people + "人");
            for (int i = 0; i < size; i++) {
                //分层遍历，增加一层for循环，在for循环里再进行poll()!!!
                Coordinate coor = queue.poll();
                for (int j = 0; j < 4; j++) {
                    Coordinate adj = new Coordinate(
                        coor.x + directionX[j],
                        coor.y + directionY[j]
                    );
                    if (inBound(adj, grid)) {
                        if (grid[adj.x][adj.y] == 0) {
                            grid[adj.x][adj.y] = 1;
                            people--;
                            if (people == 0) {
                                return time;
                            }
                            queue.offer(adj);
                        }
                    }
                }
            }
        }
        return -1;
    }
    private boolean inBound(Coordinate coor, int[][] grid) {
        int n = grid.length;
        int m = grid[0].length;
        int x = coor.x;
        int y = coor.y;
        return x >= 0 && x < n && y >= 0 && y < m && grid[x][y] != 2;
    }
}