1class Solution {2 public int largestAltitude(int[] gain) {3 int max_alt = 0;4 int curr_alt = 0;5 for (int i = 0; i < gain.length; i++) {6 curr_alt += gain[i];7 max_alt = Math.max(curr_alt, max_alt);8 }9 return max_alt;10 }11}1213// TC: O(n), SC: O(1)
WPM •0 •0
ACC •0 •0
TIME •0