René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/maximum-sum-circular-subarray","name":"#918 - Maximum Sum Circular Subarray - LeetCode JavaScript Solutions","description":"Given a circular integer array nums of length n, return the maximum possible sum of a non-empty subarray of nums. A circular array means the...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {number}\n */\nvar maxSubarraySumCircular = function(nums) {\n  let [min, max, sum] = [nums[0], nums[0], nums[0]];\n\n  for (let i = 1, prevMin = nums[0], prevMax = nums[0]; i < nums.length; i++) {\n    prevMax = Math.max(nums[i], prevMax + nums[i]);\n    max = Math.max(max, prevMax);\n    prevMin = Math.min(nums[i], prevMin + nums[i]);\n    min = Math.min(min, prevMin);\n    sum += nums[i];\n  }\n\n  return max > 0 ? Math.max(max, sum - min) : max;\n};","keywords":"LeetCode 918, #918 - Maximum Sum Circular Subarray, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}