[LeetCode]#1732. Find the Highest Altitude

Environment: Python 3.8

Key technique: max

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.

Analysis:

1. Initial ans[0]=0
2. Calculate ans[n]+gain[n]
3. Append ans[n+1]
4. Return max(ans)

Solution:

class Solution:
    def largestAltitude(self, gain):
        ans=[]
        ans.append(0)
        for i in range(0,len(gain)):
            tmp=ans[i]+gain[i]
            ans.append(tmp)
            
        return max(ans)

Submissions: