René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/non-decreasing-array","name":"#665 - Non-decreasing Array - LeetCode JavaScript Solutions","description":"Given an array nums with n integers, your task is to check if it could become non-decreasing by modifying at most one element. We define an ...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {boolean}\n */\nvar checkPossibility = function(nums) {\n  let count = 0;\n\n  for (let i = 0; i < nums.length - 1; i++) {\n    if (nums[i] > nums[i + 1]) {\n      count++;\n      if (count > 1) return false;\n      if (i > 0 && nums[i - 1] > nums[i + 1]) {\n        nums[i + 1] = nums[i];\n      } else {\n        nums[i] = nums[i + 1];\n      }\n    }\n  }\n\n  return true;\n};","keywords":"LeetCode 665, #665 - Non-decreasing Array, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}