On an N x N grid
, each square grid[i][j]
represents the elevation at that point (i,j)
.
Now rain starts to fall. At time t
, the depth of the water everywhere is t
. 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 t
. You can swim infinite distance in zero time. Of course, you must stay within the boundaries of the grid during your swim.
You start at the top left square (0, 0)
. What is the least time until you can reach the bottom right square (N-1, N-1)
?
Example 1:
Input: [[0,2],[1,3]] Output: 3 Explanation: At time0
, 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 time3
. When the depth of water is3
, we can swim anywhere inside the grid.
Example 2:
Input: [[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]] Output: 16 Explanation: 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 The final route is marked in bold. We need to wait until time 16 so that (0, 0) and (4, 4) are connected.
Note:
2 <= N <= 50
.- grid[i][j] is a permutation of [0, ..., N*N - 1].
简单来说,本题要找出一条到达终点的路径,使得其中经过的节点的最大值最小。使用优先队列可以简单实现之。
代码:
class Tuple {
public:
Tuple(int r, int c, int v) : row(r), col(c), val(v) {}
int row, col, val;
};
struct cmp {
bool operator()(const Tuple& a, const Tuple& b) {
return a.val > b.val;
};
};
class Solution {
public:
int swimInWater(vector<vector<int>>& grid) {
int n = grid.size();
vector<vector<bool>> visited(n, vector<bool>(n, false));
int result = grid[0][0];
priority_queue<Tuple, vector<Tuple>, cmp> q;
q.push(Tuple(0, 0, grid[0][0]));
int rd[4] = {0, 1, 0, -1};
int cd[4] = {1, 0, -1, 0};
while(!q.empty()) {
int r = q.top().row, c = q.top().col, v = q.top().val;
q.pop();
result = max(result, v);
if(r == n-1 && c == n-1) {
return result;
}
visited[r][c] = true;
for(int i = 0; i < 4; ++i) {
int newr = r + rd[i], newc = c + cd[i];
if(newr >= 0 && newr < n && newc >= 0 && newc < n) {
if(!visited[newr][newc]) {
q.push(Tuple(newr, newc, grid[newr][newc]));
}
}
}
}
return -1;
}
};