DFS+二分图

DFS + 二分突破

看了大佬的二分+DFS模板之后，发现真是屡试不爽：水位上升的泳池中游泳，这篇文章真的很不错，之后，我自己做了几道差不多的题目，学以致用：

这是一道猿辅导周赛题目（1631. 最小体力消耗路径）我记得当时做的时候，就止步于这道题目，当我再次能做出来的时候，真的很激动，很是享受这种征服的感觉。

---

rows == heights.length
columns == heights[i].length
1 <= rows, columns <= 100
1 <= heights[i][j] <= 10^6

class Solution {
    int[][] direct = {{0,1},{0,-1},{1,0},{-1,0}};
    public int minimumEffortPath(int[][] heights) {
        int len = heights.length; if(len == 0) return 0;
        int wid = heights[0].length;if(wid == 0) return 0;
        int left = 0, right = 1000000, res = 0; // 这里是因为 1 <= heights[i][j] <= 10^6
        while(left <= right){
            int mid = (left + right) >> 1;
            int[][] vis = new int[len][wid];
            if(dfs(heights,0,0,mid,vis)){ //可以找到一条路径，前后差值都 <= mid
                res = mid;
                right = mid-1;
            }else left = mid+1;
        }
        return res;
    }
    public boolean dfs(int[][] heights, int x, int y, int mid, int[][] vis){
        vis[x][y] = 1;
        if(x == heights.length-1 && y == heights[0].length-1) return true;
        for(int i = 0; i<4; i++){
            int new_x = x+direct[i][0];
            int new_y = y+direct[i][1];
            if(InArea(new_x,new_y, heights) && vis[new_x][new_y] == 0 && 
            Math.abs(heights[x][y] - heights[new_x][new_y]) <= mid){ // 前后差比较
                if(dfs(heights, new_x,new_y,mid,vis)) return true;
            }
        }
        return false;
    }
    public boolean InArea(int x, int y, int[][]heights){
        if(x >= 0 && x < heights.length && y >= 0 && y < heights[0].length) return true;
        return false;
    }
}

---

778. 水位上升的泳池中游泳

题主那道题，进行了重构（其实差不多）

class Solution {
    int[][] direct = {{0,1},{0,-1},{1,0},{-1,0}};
    public int swimInWater(int[][] grid) {
        int len = grid.length; if(len == 0) return 0;
        int wid = grid[0].length; if(wid == 0) return 0;
        int left = grid[0][0], right = 50*50-1;
        int ans = 0;
        while(left <= right){
            int mid = (left+right) >> 1;
            int[][] vis = new int[len][wid];
            if(dfs(grid, 0, 0, vis, mid)){
                ans = mid;
                right = mid-1;
            }else left = mid+1;
        }
        return ans;
    }

    public boolean dfs(int[][] grid, int x, int y, int[][] vis, int mid){
        vis[x][y] = 1;
        if(x == grid.length-1 && y == grid[0].length-1) return true;
        for(int i = 0; i<4; i++){
            int n_x = x + direct[i][0];
            int n_y = y + direct[i][1];
            if(InArea(n_x,n_y,grid) && vis[n_x][n_y] == 0 && grid[n_x][n_y] <= mid){
                if(dfs(grid, n_x, n_y, vis, mid)) return true;
            }
        }
        return false;
    }
    public boolean InArea(int x, int y, int[][] grid){
        if(x >= 0 && x < grid.length && y >= 0 && y < grid[0].length) return true;
        return false;
    }
}