René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/maximum-ascending-subarray-sum","name":"#1800 - Maximum Ascending Subarray Sum - LeetCode JavaScript Solutions","description":"Given an array of positive integers nums, return the maximum possible sum of an ascending subarray in nums. A subarray is defined as a conti...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {number}\n */\nvar maxAscendingSum = function(nums) {\n  let result = nums[0];\n  for (let i = 1, max = nums[0]; i < nums.length; i++) {\n    max = nums[i] > nums[i - 1] ? max + nums[i] : nums[i];\n    result = Math.max(result, max);\n  }\n  return result;\n};","keywords":"LeetCode 1800, #1800 - Maximum Ascending Subarray Sum, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}