Leetcode 1732. Find the Highest Altitude

最新推荐文章于 2024-07-05 21:55:11 发布

小白菜又菜

最新推荐文章于 2024-07-05 21:55:11 发布

阅读量543

点赞数 11

分类专栏： Leetcode 解题报告入门题文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/mobius_strip/article/details/135371447

版权

解题报告同时被 3 个专栏收录

1365 篇文章 4 订阅

订阅专栏

入门题

291 篇文章 2 订阅

订阅专栏

Leetcode

146 篇文章 0 订阅

订阅专栏

Problem

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.

Algorithm

Accumulate data and judge.

Code

class Solution:
    def largestAltitude(self, gain: List[int]) -> int:
        ans, altitude = 0, 0
        glen = len(gain)
        for i in range(glen):
            altitude = altitude + gain[i]
            if ans < altitude:
                ans = altitude
        
        return ans