0066. Plus One.js

// 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.

// Example 1:

// Input: [1,2,3]
// Output: [1,2,4]
// Explanation: The array represents the integer 123.

// Example 2:

// Input: [4,3,2,1]
// Output: [4,3,2,2]
// Explanation: The array represents the integer 4321.


/**
 * @param {number[]} digits
 * @return {number[]}
 */
var plusOne = function(digits) {
  return (BigInt(digits.join('')) + 1n + '').split('').map(Number)
}
// Runtime: 52 ms, faster than 85.42% of JavaScript online submissions for Plus One.
// Memory Usage: 33.7 MB, less than 89.36% of JavaScript online submissions for Plus One.
// console.log(plusOne([6, 1, 4, 5, 3, 9, 0, 1, 9, 5, 1, 8, 6, 7, 0, 5, 5, 4, 3]));


/**
 * @param {number[]} digits
 * @return {number[]}
 */
const plusOne = (digits) => {
  let i = digits.length
  while (i--) {
    digits[i] += 1
    if (digits[i] < 10) {
      return digits
    }
    digits[i] = 0
  }
  digits.unshift(1)
  return digits
}
// Runtime: 48 ms, faster than 95.74% of JavaScript online submissions for Plus One.
// Memory Usage: 33.7 MB, less than 93.62% of JavaScript online submissions for Plus One.