René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/sort-transformed-array","name":"#360 - Sort Transformed Array - LeetCode JavaScript Solutions","description":"Given a sorted integer array nums and three integers a, b and c, apply a quadratic function of the form f(x) = ax2 + bx + c to each element ...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @param {number} a\n * @param {number} b\n * @param {number} c\n * @return {number[]}\n */\nvar sortTransformedArray = function(nums, a, b, c) {\n  const result = new Array(nums.length);\n  let left = 0;\n  let right = nums.length - 1;\n  let index = a >= 0 ? nums.length - 1 : 0;\n\n  while (left <= right) {\n    const leftVal = transform(nums[left]);\n    const rightVal = transform(nums[right]);\n\n    if (a >= 0) {\n      if (leftVal > rightVal) {\n        result[index--] = leftVal;\n        left++;\n      } else {\n        result[index--] = rightVal;\n        right--;\n      }\n    } else {\n      if (leftVal < rightVal) {\n        result[index++] = leftVal;\n        left++;\n      } else {\n        result[index++] = rightVal;\n        right--;\n      }\n    }\n  }\n\n  return result;\n\n  function transform(x) {\n    return a * x * x + b * x + c;\n  }\n};","keywords":"LeetCode 360, #360 - Sort Transformed Array, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}