type
status
date
slug
summary
tags
category
icon
password
1732. Find the Highest Altitude
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:
Example 2:
Solution:
A straightforward question, the major solution is to successively sum 2 Adjacent elements in the list, just like the example.
My first answer is:
Then, I found another one which used the python API:
One line, and the space complexity is O(1).
My thought after this question is to use Python APIs (such as
accumulate()) as much as I can since it probably has been optimized by someone else. Unless I am not so happy with their performance.
- 作者:Parker Chen
- 链接:www.parkerchenca.com/article/241f0ccf-d7f8-8112-814c-eb563aea74d2
- 声明:本文采用 CC BY-NC-SA 4.0 许可协议，转载请注明出处。
相关文章
