Java Easy solution with (n) 0ms
\nclass Solution {\n    public int largestAltitude(int[] gain) {\n        int highestPoint = 0;\n\n        int point = 0;\n\n        for (int i = 0; i < gain.le
```\nclass Solution {\n    public int largestAltitude(int[] gain) {\n        int highestPoint = 0;\n\n        int point = 0;\n\n        for (int i = 0; i < gain.length; i++) {\n            point += gain[i];\n\n            highestPoint = Math.max(highestPoint, point);\n        }\n        return highestPoint;\n    }\n}\n```
['Java']