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

Method Point

Java/path-with-minimum-effort.java:14–18  ·  view source on GitHub ↗
(int x, int y, int height)

Source from the content-addressed store, hash-verified

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) {

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected