1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
|
// 1732. Find the Highest Altitude
#include "leetcode.h"
/*
* 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 0. given an integer array 'ain' of length 'n' where 'gain[i]' is the
* net gain in altidude between points 'i' and 'i + 1' for all '0 <= i < n'.
* return the highest altitude of a point
*/
class Solution {
public:
int largestAltitude(vector<int> &gain) {
int ans = INT_MIN, pre_sum = 0;
for (int i = 0; i < gain.size(); i++) {
ans = max(pre_sum, ans);
pre_sum += gain[i];
}
if (pre_sum > ans)
ans = pre_sum;
return ans;
}
};
int main() {
Solution obj;
vector<int> g1 = {-5, 1, 5, 0, -7}, g2 = {-4, -3, -2, -1, 4, 3, 2};
printf("%d\n", obj.largestAltitude(g1)); // expect: 1
printf("%d\n", obj.largestAltitude(g2)); // expect: 0
}
|