Problem Name : Path with Minimum Effort Concept Involved : Graphs, Dijkstra's Shortest Path Execution Time : 1229 ms Memory Consumed : 39.4 mb
| 7 | * |
| 8 | */ |
| 9 | class Point{ |
| 10 | int x; |
| 11 | int y; |
| 12 | int height; |
| 13 | |
| 14 | public Point(int x, int y, int height){ |
| 15 | this.x = x; |
| 16 | this.y = y; |
| 17 | this.height = height; |
| 18 | } |
| 19 | } |
| 20 | class Solution { |
| 21 | public int minimumEffortPath(int[][] heights) { |
| 22 | int n = heights.length; |
nothing calls this directly
no outgoing calls
no test coverage detected