← 返回 google 的题目列表Grid Path Cost
类型:online_judge
Given a grid, find a path from the start to the end where the cost is derived from the highest value on the path, and you can only step on a cell if the water level is greater than or equal to the cell's height. Implement a method to return the minimum possible maximum value of the path.
Example
Input
[[0, 2], [1, 3]]
Output
3