[leetCode]778. 水位上升的泳池中游泳

题目

https://leetcode-cn.com/problems/swim-in-rising-water/

二分查找

如果在某一个时间 t0，可以从左上角到达右下角那么，当 t > t0 时仍然可以从左上角到达右下角，因此可以使用二分查找。
根据提示给的范围在[0, N*N - 1]区间内猜一个数，然后进行深度优先搜索，或者广度优先搜索，搜索完毕时根据是否能到达左下角来确定如何缩小区间范围。

class Solution {

    private int[][] dirs = new int[][]{{0, 1}, {1, 0}, {0, -1}, {-1, 0}};

    public int swimInWater(int[][] grid) {
        int N = grid.length;
        int left = 0, right = N * N - 1;
        int ans = 0;
        while (left <= right) {
            int mid = left + (right - left) / 2;
            boolean[][] seen = new boolean[N][N];
            Queue<int[]> queue = new LinkedList<>();
            if (grid[0][0] <= mid) {
                queue.offer(new int[]{0, 0});
                seen[0][0] = true;
            } else {
                left = mid + 1;
                continue;
            }
            
            while (!queue.isEmpty()) {
                int[] cell = queue.poll();
                int x = cell[0], y = cell[1];
                for (int[] dir : dirs) {
                    int nx = x + dir[0];
                    int ny = y + dir[1];
                    if (nx >= 0 && nx < N && ny >= 0 && ny < N && !seen[nx][ny] && grid[nx][ny] <= mid) {
                        queue.offer(new int[]{nx, ny});
                        seen[nx][ny] = true;
                    }
                }
            }
            if (seen[N - 1][N - 1]) {
                right = mid - 1;
                ans = mid;
            } else {
                left = mid + 1;
            }
        }
        return ans;
    }
}

并查集

模拟下雨的过程，边的权值为两个顶点之间较大的那个值，将边从大到小排序，然后使用并查集进行合并，如果合并到某个边时，左上角的顶点和右下角的顶点连通了，也就找到了最短的时间。

class Solution {
    public int swimInWater(int[][] grid) {
        int N = grid.length;
        List<int[]> edges = new ArrayList<>();
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                int id = i * N + j;
                if (i > 0) {
                    edges.add(new int[]{id - N, id, Math.max(grid[i][j], grid[i - 1][j])});
                }
                if (j > 0) {
                    edges.add(new int[]{id - 1, id, Math.max(grid[i][j], grid[i][j - 1])});
                }
            }
        }
        Collections.sort(edges, (o1, o2)-> o1[2] - o2[2]);
        UnionFind uf = new UnionFind(N * N);
        int ans = 0;
        for (int[] edge : edges) {
            int x = edge[0], y = edge[1], v = edge[2];
            uf.union(x, y);
            if (uf.connected(0, N * N - 1)) {
                ans = v;
                break;
            }
        }
        return ans;
    }

    class UnionFind {
        int[] parent;
        public UnionFind(int n) {
            parent = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
            }
        }
        public int find(int x) {
            while (x != parent[x]) {
                parent[x] = parent[parent[x]];
                x = parent[x];
            }
            return x;
        }
        public void union(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);
            if (rootX == rootY) 
                return;
            parent[rootX] = rootY;
        }
        public boolean connected(int x, int y) {
            return find(x) == find(y);
        }
    }
}