{"id":8263,"date":"2021-03-21T22:23:26","date_gmt":"2021-03-22T05:23:26","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=8263"},"modified":"2021-03-21T22:23:45","modified_gmt":"2021-03-22T05:23:45","slug":"leetcode-1800-maximum-ascending-subarray-sum","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/algorithms\/array\/leetcode-1800-maximum-ascending-subarray-sum\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1800. Maximum Ascending Subarray Sum"},"content":{"rendered":"\n

Given an array of positive integers nums<\/code>, return the maximum possible sum of an ascending<\/strong> subarray in <\/em>nums<\/code>.<\/p>\n\n\n\n

A subarray is defined as a contiguous sequence of numbers in an array.<\/p>\n\n\n\n

A subarray [numsl<\/sub>, numsl+1<\/sub>, ..., numsr-1<\/sub>, numsr<\/sub>]<\/code> is ascending<\/strong> if for all i<\/code> where l <= i < r<\/code>, numsi <\/sub>< numsi+1<\/sub><\/code>. Note that a subarray of size 1<\/code> is ascending<\/strong>.<\/p>\n\n\n\n

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

Input:<\/strong> nums = [10,20,30,5,10,50]\nOutput:<\/strong> 65\nExplanation: <\/strong>[5,10,50] is the ascending subarray with the maximum sum of 65.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> nums = [10,20,30,40,50]\nOutput:<\/strong> 150\nExplanation: <\/strong>[10,20,30,40,50] is the ascending subarray with the maximum sum of 150.\n<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> nums = [12,17,15,13,10,11,12]\nOutput:<\/strong> 33\nExplanation: <\/strong>[10,11,12] is the ascending subarray with the maximum sum of 33.\n<\/pre>\n\n\n\n
Example 4:<\/strong><\/p>\n\n\n\n
Input:<\/strong> nums = [100,10,1]\nOutput:<\/strong> 100\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 1 <= nums.length <= 100<\/code><\/li>
  • 1 <= nums[i] <= 100<\/code><\/li><\/ul>\n\n\n\n
    Solution: Running sum with resetting<\/strong><\/h2>\n\n\n\n
    Time complexity: O(n)
    Space complexity: O(1)<\/p>\n\n\n\n
    Track the running sum and reset it to zero if nums[i] <= nums[i – 1]<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \n\/\/ Author: Huahua\nclass Solution {\npublic:\n  int maxAscendingSum(vector& nums) {    \n    int ans = 0;\n    for (int i = 0, s = 0; i < nums.size(); ++i) {\n      if (i && nums[i] <= nums[i - 1])\n        s = 0;\n      ans = max(ans, s += nums[i]);\n    }\n    return ans;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    Given an array of positive integers nums, return the maximum possible sum of an ascending subarray in nums. A subarray is defined as a contiguous sequence of numbers in an…<\/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,200],"class_list":["post-8263","post","type-post","status-publish","format-standard","hentry","category-array","tag-array","tag-easy","tag-prefix-sum","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8263","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=8263"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8263\/revisions"}],"predecessor-version":[{"id":8265,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8263\/revisions\/8265"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=8263"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=8263"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=8263"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}