[1219. 黄金矿工](https://leetcode.cn/problems/path-with-maximum-gold/) [1254. 统计封闭岛屿的数目](https://leetcode.cn/problems/number-of-closed-islands/) [1568. 使陆地分离的最少天数](https://leetcode.cn/problems/minimum-number-of-days-to-disconnect-island/) [1905. 统计子岛屿](https:...
Explanation: The shortest path without eliminating any obstacle is 10. The shortest path with one obstacle elimination at position (3,2) is 6. Such path is(0,0) -> (0,1) -> (0,2) -> (1,2) -> (2,2) -> (3,2) -> (4,2). Example 2: Input: grid = [[0,1,1], [1,...