README_EN.md

1732. Find the Highest Altitude

中文文档

Description

There is a biker going on a road trip. The road trip consists of n + 1 points at different altitudes. The biker starts his trip on point 0 with altitude equal 0.

You are given an integer array gain of length n where gain[i] is the net gain in altitude between points i​​​​​​ and i + 1 for all (0 <= i < n). Return the highest altitude of a point.

 

Example 1:

Input: gain = [-5,1,5,0,-7]
Output: 1
Explanation: The altitudes are [0,-5,-4,1,1,-6]. The highest is 1.

Example 2:

Input: gain = [-4,-3,-2,-1,4,3,2]
Output: 0
Explanation: The altitudes are [0,-4,-7,-9,-10,-6,-3,-1]. The highest is 0.

 

Constraints:

• n == gain.length
• 1 <= n <= 100
• -100 <= gain[i] <= 100

Solutions

Python3

class Solution:
    def largestAltitude(self, gain: List[int]) -> int:
        return max(accumulate(gain, initial=0))

class Solution:
    def largestAltitude(self, gain: List[int]) -> int:
        ans = s = 0
        for v in gain:
            s += v
            ans = max(ans, s)
        return ans

Java

class Solution {
    public int largestAltitude(int[] gain) {
        int ans = 0, s = 0;
        for (int v : gain) {
            s += v;
            ans = Math.max(ans, s);
        }
        return ans;
    }
}

C++

class Solution {
public:
    int largestAltitude(vector<int>& gain) {
        int ans = 0, s = 0;
        for (int v : gain) s += v, ans = max(ans, s);
        return ans;
    }
};

Go

func largestAltitude(gain []int) (ans int) {
	s := 0
	for _, v := range gain {
		s += v
		if ans < s {
			ans = s
		}
	}
	return
}

JavaScript

/**
 * @param {number[]} gain
 * @return {number}
 */
var largestAltitude = function (gain) {
    let ans = 0;
    let s = 0;
    for (const v of gain) {
        s += v;
        ans = Math.max(ans, s);
    }
    return ans;
};

...