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:
        res = t = 0
        for h in gain:
            t += h
            res = max(res, t)
        return res

Java

class Solution {
    public int largestAltitude(int[] gain) {
        int res = 0;
        int t = 0;
        for (int h : gain) {
            t += h;
            res = Math.max(res, t);
        }
        return res;
    }
}

C++

class Solution {
public:
    int largestAltitude(vector<int>& gain) {
        int res = 0, t = 0;
        for (int h : gain)
        {
            t += h;
            res = max(res, t);
        }
        return res;
    }
};

Go

func largestAltitude(gain []int) int {
	res, t := 0, 0
	for _, h := range gain {
		t += h
		res = max(res, t)
	}
	return res
}

func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

...