René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/minimize-deviation-in-array","name":"#1675 - Minimize Deviation in Array - LeetCode JavaScript Solutions","description":"You are given an array nums of n positive integers. You can perform two types of operations on any element of the array any number of times:...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {number}\n */\nvar minimumDeviation = function(nums) {\n  const heap = [];\n  let minElement = Infinity;\n\n  for (const num of nums) {\n    const value = num % 2 ? num * 2 : num;\n    heap.push(value);\n    minElement = Math.min(minElement, value);\n  }\n\n  for (let i = Math.floor(heap.length / 2) - 1; i >= 0; i--) {\n    siftDown(i);\n  }\n\n  let minDeviation = heap[0] - minElement;\n\n  while (heap[0] % 2 === 0) {\n    const maxElement = heap[0];\n    heap[0] = maxElement / 2;\n    minElement = Math.min(minElement, heap[0]);\n    siftDown(0);\n    minDeviation = Math.min(minDeviation, heap[0] - minElement);\n  }\n\n  return minDeviation;\n\n  function siftDown(index) {\n    while (2 * index + 1 < heap.length) {\n      let maxChild = 2 * index + 1;\n      if (maxChild + 1 < heap.length && heap[maxChild + 1] > heap[maxChild]) {\n        maxChild++;\n      }\n      if (heap[index] < heap[maxChild]) {\n        [heap[index], heap[maxChild]] = [heap[maxChild], heap[index]];\n        index = maxChild;\n      } else {\n        break;\n      }\n    }\n  }\n};","keywords":"LeetCode 1675, #1675 - Minimize Deviation in Array, Hard, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}