Package g0701_0800.s0778_swim_in_rising_water

Class Solution

java.lang.Object

g0701_0800.s0778_swim_in_rising_water.Solution

public class Solution
extends Object

778 - Swim in Rising Water.<p>Hard</p> <p>You are given an <code>n x n</code> integer matrix <code>grid</code> where each value <code>grid[i][j]</code> represents the elevation at that point <code>(i, j)</code>.</p> <p>The rain starts to fall. At time <code>t</code>, the depth of the water everywhere is <code>t</code>. You can swim from a square to another 4-directionally adjacent square if and only if the elevation of both squares individually are at most <code>t</code>. You can swim infinite distances in zero time. Of course, you must stay within the boundaries of the grid during your swim.</p> <p>Return <em>the least time until you can reach the bottom right square</em> <code>(n - 1, n - 1)</code> <em>if you start at the top left square</em> <code>(0, 0)</code>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/06/29/swim1-grid.jpg" alt="" /></p> <p><strong>Input:</strong> grid = [[0,2],[1,3]]</p> <p><strong>Output:</strong> 3</p> <p><strong>Explanation:</strong></p> <pre><code> At time 0, you are in grid location (0, 0). You cannot go anywhere else because 4-directionally adjacent neighbors have a higher elevation than t = 0. You cannot reach point (1, 1) until time 3. When the depth of water is 3, we can swim anywhere inside the grid. </code></pre> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/06/29/swim2-grid-1.jpg" alt="" /></p> <p><strong>Input:</strong> grid = [[0,1,2,3,4],[24,23,22,21,5],[12,13,14,15,16],[11,17,18,19,20],[10,9,8,7,6]]</p> <p><strong>Output:</strong> 16</p> <p><strong>Explanation:</strong></p> <pre><code> The final route is shown. We need to wait until time 16 so that (0, 0) and (4, 4) are connected. </code></pre> <p><strong>Constraints:</strong></p> <ul> <li><code>n == grid.length</code></li> <li><code>n == grid[i].length</code></li> <li><code>1 <= n <= 50</code></li> <li><code>0 <= grid[i][j] < n²</code></li> <li>Each value <code>grid[i][j]</code> is <strong>unique</strong>.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
boolean	bfs(int[][] grid, int limit)
int	swimInWater(int[][] grid)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

swimInWater

public int swimInWater(int[][] grid)

bfs

public boolean bfs(int[][] grid,
 int limit)