{"id":8003,"date":"2021-01-23T11:27:40","date_gmt":"2021-01-23T19:27:40","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=8003"},"modified":"2021-01-23T11:28:14","modified_gmt":"2021-01-23T19:28:14","slug":"leetcode1732-find-the-highest-altitude","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/algorithms\/array\/leetcode1732-find-the-highest-altitude\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode1732. Find the Highest Altitude"},"content":{"rendered":"\n

There is a biker going on a road trip. The road trip consists of n + 1<\/code> points at different altitudes. The biker starts his trip on point 0<\/code> with altitude equal 0<\/code>.<\/p>\n\n\n\n

You are given an integer array gain<\/code> of length n<\/code> where gain[i]<\/code> is the net gain in altitude<\/strong> between points i<\/code>\u200b\u200b\u200b\u200b\u200b\u200b and i + 1<\/code> for all (0 <= i < n)<\/code>. Return the highest altitude<\/strong> of a point.<\/em><\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> gain = [-5,1,5,0,-7]\nOutput:<\/strong> 1\nExplanation:<\/strong> The altitudes are [0,-5,-4,1,1,-6]. The highest is 1.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> gain = [-4,-3,-2,-1,4,3,2]\nOutput:<\/strong> 0\nExplanation:<\/strong> The altitudes are [0,-4,-7,-9,-10,-6,-3,-1]. The highest is 0.\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • n == gain.length<\/code><\/li>
  • 1 <= n <= 100<\/code><\/li>
  • -100 <= gain[i] <= 100<\/code><\/li><\/ul>\n\n\n\n
    Solution: Running Max<\/strong><\/h2>\n\n\n\n
    Time complexity: O(n)
    Space complexity: O(1)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \n\/\/ Author: Huahua\nclass Solution {\npublic:\n  int largestAltitude(vector& gain) {\n    int ans = 0;\n    int cur = 0;\n    for (int diff : gain)\n      ans = max(ans, cur += diff);\n    return ans;\n  }\n};\n<\/pre>\n<\/div><\/div>\n\n\n\n
    <\/p>\n","protected":false},"excerpt":{"rendered":"
    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…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[184],"tags":[20,222,141],"class_list":["post-8003","post","type-post","status-publish","format-standard","hentry","category-array","tag-array","tag-easy","tag-max","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8003","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=8003"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8003\/revisions"}],"predecessor-version":[{"id":8006,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8003\/revisions\/8006"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=8003"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=8003"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=8003"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}