LeetCode 827. 最大人工岛

827. 最大人工岛

 

【BFS+并查集+哈希表+枚举】先BFS求出每一个连接块的最大面积，然后并查集把每一个格子连起来，用哈希表记录每一块的面积，然后枚举所有的0就行了。

class Solution {

    // 8:12 64
    // BFS + 哈希

    Map<Integer, Integer> map = new HashMap();
    int[][] visit, grid;
    int n, ans = 1;
    int[][] d = new int[][] {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
    int[] far;

    int check(int x) {
        return x == far[x] ? x: check(far[x]);
    }

    void union(int x, int y) {
        far[check(y)] = far[check(x)];
    }

    public void bfs(int x, int y) {
        Deque<int[]> queue = new LinkedList();
        queue.offer(new int[] {x, y});
        int s = 1, nx, ny;
        List<Integer> list = new ArrayList();
        visit[x][y] = 1;
        int f = x * n + y;
        while (!queue.isEmpty()) {
            var top = queue.poll();
            x = top[0]; y = top[1];
            for (var i = 0; i < 4; i++) {
                nx = x + d[i][0];
                ny = y + d[i][1];
                if (nx >= 0 && nx < n && ny >= 0 && ny < n && grid[nx][ny] == 1 && visit[nx][ny] == -1) {
                    queue.offer(new int[] {nx, ny});
                    union(f, nx * n + ny);
                    visit[nx][ny] = 1;
                    s++;
                } 
            }
        }
        ans = Math.max(s, ans);
        map.put(f, s);
    }

    public int largestIsland(int[][] grid) {
        n = grid.length;
        this.grid = grid;
        visit = new int[n][n];
        far = new int[n * n];
        for (var i = 0; i < n * n; i++) far[i] = i;
        for (var i = 0; i < n; i++) Arrays.fill(visit[i], -1);
        for (var i = 0; i < n; i++) {
            for (var j = 0; j < n; j++) {
                if (visit[i][j] == -1 && grid[i][j] == 1) bfs(i, j);
            }
        }
        // for (var x: map.keySet()) {
        //     System.out.println(x + "," + map.get(x));
        // }
        int sum = 0;
        for (var i = 0; i < n; i++) {
            for (var j = 0; j < n; j++) {
                if (grid[i][j] == 0) {
                    sum = 1;
                    Set<Integer> set = new HashSet();
                    for (var k = 0; k < 4; k++) {
                        int x = i + d[k][0];
                        int y = j + d[k][1];
                        if (x >= 0 && x < n && y >= 0 && y < n && grid[x][y] == 1) {
                            int tmp = check(x * n + y);
                            if (!set.contains(tmp)) {
                                sum += map.get(tmp);
                                set.add(tmp);
                            }
                        } 
                    }
                    ans = Math.max(ans, sum);
                }
            }
        }
        return ans;
    }
}