René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/reverse-subarray-to-maximize-array-value","name":"#1330 - Reverse Subarray To Maximize Array Value - LeetCode JavaScript Solutions","description":"You are given an integer array nums. The value of this array is defined as the sum of |nums[i] - nums[i + 1]| for all 0 <= i < nums.le...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {number}\n */\nvar maxValueAfterReverse = function(nums) {\n  let baseSum = 0;\n  let maxGain = 0;\n  let minPair = Infinity;\n  let maxPair = -Infinity;\n  const n = nums.length;\n\n  for (let i = 0; i < n - 1; i++) {\n    baseSum += Math.abs(nums[i] - nums[i + 1]);\n    minPair = Math.min(minPair, Math.max(nums[i], nums[i + 1]));\n    maxPair = Math.max(maxPair, Math.min(nums[i], nums[i + 1]));\n  }\n\n  maxGain = Math.max(0, 2 * (maxPair - minPair));\n\n  for (let i = 0; i < n - 1; i++) {\n    const left = i > 0 ? Math.abs(nums[0] - nums[i + 1]) - Math.abs(nums[i] - nums[i + 1]) : 0;\n    const right = i < n - 2 ? Math.abs(nums[n - 1] - nums[i]) - Math.abs(nums[i] - nums[i + 1]) : 0;\n    maxGain = Math.max(maxGain, left, right);\n  }\n\n  return baseSum + maxGain;\n};","keywords":"LeetCode 1330, #1330 - Reverse Subarray To Maximize Array Value, Hard, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}