René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/array-transformation","name":"#1243 - Array Transformation - LeetCode JavaScript Solutions","description":"Given an initial array arr, every day you produce a new array using the array of the previous day. On the i-th day, you do the following ope...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} arr\n * @return {number[]}\n */\nvar transformArray = function(arr) {\n  let current = [...arr];\n\n  while (true) {\n    const next = [...current];\n    let changed = false;\n\n    for (let i = 1; i < current.length - 1; i++) {\n      if (current[i] < current[i - 1] && current[i] < current[i + 1]) {\n        next[i]++;\n        changed = true;\n      } else if (current[i] > current[i - 1] && current[i] > current[i + 1]) {\n        next[i]--;\n        changed = true;\n      }\n    }\n\n    if (!changed) break;\n    current = next;\n  }\n\n  return current;\n};","keywords":"LeetCode 1243, #1243 - Array Transformation, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}