66-plus-one

DevGod

Vtuber

Caution

DevGod needs to write an editorial for this problem!

java

class Solution {
    public int[] plusOne(int[] digits) {
        for (int i = digits.length - 1; i >= 0; i--) {
            if (digits[i] < 9) {
                digits[i]++;
                return digits;
            }
            digits[i] = 0;
        }

        digits = new int[digits.length + 1];
        digits[0] = 1;
        return digits;
    }
}

js

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