Leetcode Problem 778. Swim in Rising Water

778. Swim in Rising Water

Leetcode Solutions

Define a function possible(T) that returns True if it's possible to reach the end at time T using DFS.
Perform a binary search on T from 0 to max(grid).
In each iteration of the binary search, call possible(mid) where mid is the midpoint of the current search range.
If possible(mid) returns True, search the lower half; otherwise, search the upper half.
Continue until the search range is narrowed down to the minimum T that returns True for possible(T).
Return the minimum T.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen