GeezerVison

The World Wide Web, restored to 800 pixels of glory.

GeezerVison is showing leetcodejavascript.com — #66 - Plus One - LeetCode JavaScript Solutions

Back to all solutions

#66 - Plus One

Easy • View on LeetCode • View on GitHub

Array Math

Problem 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 significant digit is at the head of the list, and each element in the array contain a single digit.

You may assume the integer does not contain any leading zero, except the number 0 itself.

Solution

/**
 * @param {number[]} digits
 * @return {number[]}
 */
var plusOne = function(digits) {
  let i = digits.length - 1;
  digits[i] += 1;
  while (digits[i] > 9) {
    digits[i--] = 0;
    if (digits[i]) {
      digits[i] += 1;
    } else {
      digits.unshift(1);
    }
  }
  return digits;
};

// alternative one-liner that breaks the rules:
/**
 * @param {number[]} digits
 * @return {number[]}
 */
var plusOne = function(digits) {
  return String(BigInt(digits.join('')) + BigInt(1)).split('');
};

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.