aboutsummaryrefslogtreecommitdiff
path: root/find_highest_altitude.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'find_highest_altitude.cpp')
-rw-r--r--find_highest_altitude.cpp31
1 files changed, 0 insertions, 31 deletions
diff --git a/find_highest_altitude.cpp b/find_highest_altitude.cpp
deleted file mode 100644
index c67dbac..0000000
--- a/find_highest_altitude.cpp
+++ /dev/null
@@ -1,31 +0,0 @@
-// 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
-}