class Solution {
    public int largestAltitude(int[] gain) {
        int sumSoFar = 0;
        int highest = 0;

        for (int i = 0; i < gain.length; i++) {
            sumSoFar = sumSoFar + gain[i];

            if (sumSoFar > highest) {
                highest = sumSoFar;
            }
        }

        return highest;
    }
}