1732.find-the-highest-altitude.py

#
# @lc app=leetcode id=1732 lang=python3
#
# [1732] Find the Highest Altitude
#
# https://leetcode.com/problems/find-the-highest-altitude/description/
#
# algorithms
# Easy (83.72%)
# Likes:    3011
# Dislikes: 378
# Total Accepted:    534.9K
# Total Submissions: 638.8K
# Testcase Example:  '[-5,1,5,0,-7]'
#
# 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
#
#
#

# @lc code=start
from typing import List


class Solution:
    def largestAltitude(self, gain: List[int]) -> int:
        max_altitude = 0
        prefix_sum = 0
        for i in gain:
            prefix_sum += i
            max_altitude = max(prefix_sum, max_altitude)
        return max_altitude

# @lc code=end