René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/maximum-alternating-subarray-sum","name":"#2036 - Maximum Alternating Subarray Sum - LeetCode JavaScript Solutions","description":"A subarray of a 0-indexed integer array is a contiguous non-empty sequence of elements within an array. The alternating subarray sum of a su...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {number}\n */\nvar maximumAlternatingSubarraySum = function(nums) {\n let result = -Infinity;\n let positive = -Infinity;\n let negative = -Infinity;\n\n for (const num of nums) {\n const newPositive = Math.max(negative + num, num);\n const newNegative = positive - num;\n\n positive = newPositive;\n negative = newNegative;\n result = Math.max(result, positive, negative);\n }\n\n return result;\n};","keywords":"LeetCode 2036, #2036 - Maximum Alternating Subarray Sum, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}