René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/plus-one","name":"#66 - Plus One - LeetCode JavaScript Solutions","description":"Given a non-empty array of digits representing a non-negative integer, plus one to the integer. The digits are stored such that the most sig...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} digits\n * @return {number[]}\n */\nvar plusOne = function(digits) {\n let i = digits.length - 1;\n digits[i] += 1;\n while (digits[i] > 9) {\n digits[i--] = 0;\n if (digits[i]) {\n digits[i] += 1;\n } else {\n digits.unshift(1);\n }\n }\n return digits;\n};\n\n// alternative one-liner that breaks the rules:\n/**\n * @param {number[]} digits\n * @return {number[]}\n */\nvar plusOne = function(digits) {\n return String(BigInt(digits.join('')) + BigInt(1)).split('');\n};","keywords":"LeetCode 66, #66 - Plus One, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}