MCPcopy Create free account
hub / github.com/codedecks-in/LeetCode-Solutions / Point

Class Point

Java/path-with-minimum-effort.java:9–19  ·  view source on GitHub ↗

Problem Name : Path with Minimum Effort Concept Involved : Graphs, Dijkstra's Shortest Path Execution Time : 1229 ms Memory Consumed : 39.4 mb

Source from the content-addressed store, hash-verified

7 *
8*/
9class 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}
20class Solution {
21 public int minimumEffortPath(int[][] heights) {
22 int n = heights.length;

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected