|
| 1 | +classSolution { |
| 2 | + |
| 3 | +privatestaticfinalint[][]DIRS = {{1,0}, {0,1}, {-1,0}, {0, -1}}; |
| 4 | + |
| 5 | +publicintminTimeToReach(int[][]moveTime) { |
| 6 | +intn =moveTime.length; |
| 7 | +intm =moveTime[0].length; |
| 8 | +boolean[][]visited =newboolean[n][m]; |
| 9 | +Integer[][]minTime =newInteger[n][m]; |
| 10 | +minTime[0][0] =0; |
| 11 | +PriorityQueue<int[]>pq =newPriorityQueue<>((a,b) ->a[2] -b[2]); |
| 12 | +pq.add(newint[]{0,0,0}); |
| 13 | +while (!pq.isEmpty()) { |
| 14 | +int[]removed =pq.remove(); |
| 15 | +intx =removed[0]; |
| 16 | +inty =removed[1]; |
| 17 | +if (visited[x][y]) { |
| 18 | +continue; |
| 19 | + } |
| 20 | +visited[x][y] =true; |
| 21 | +for (int[]dir :DIRS) { |
| 22 | +intnewX =x +dir[0]; |
| 23 | +intnewY =y +dir[1]; |
| 24 | +if (newX >=0 &&newY >=0 &&newX <n &&newY <m) { |
| 25 | +intdistance =Math.max(minTime[x][y],moveTime[newX][newY]) +1; |
| 26 | +intcurrMinTime =minTime[newX][newY] ==null ?Integer.MAX_VALUE :minTime[newX][newY]; |
| 27 | +if (currMinTime >distance) { |
| 28 | +minTime[newX][newY] =distance; |
| 29 | +pq.add(newint[]{newX,newY,distance}); |
| 30 | + } |
| 31 | + } |
| 32 | + } |
| 33 | + } |
| 34 | +returnminTime[n -1][m -1]; |
| 35 | + } |
| 36 | +} |