AlgoLounge

Plus One

easy

You are given a large integer represented as an integer array digits, where each digits[i] is the i^(th) digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading zeros.

Increment the large integer by one and return the resulting array of digits.

Examples

Example 1

Input:  digits = [1,2,3]
Output: [1,2,4]

The array represents the integer 123. Incrementing by one gives 124.

Example 2

Input:  digits = [4,3,2,1]
Output: [4,3,2,2]

Example 3

Input:  digits = [9]
Output: [1,0]

The array represents 9. Incrementing gives 10.

Example 4

Input:  digits = [9,9,9]
Output: [1,0,0,0]

Constraints

  • 1 <= digits.length <= 100
  • 0 <= digits[i] <= 9
  • digits does not contain any leading zeros
TypeScript
Loading editor…
List of test cases (10)
Case 1
digits = [1,2,3]
Case 2
digits = [4,3,2,1]
Case 3
digits = [9]
Case 4
digits = [9,9,9]
Case 5
digits = [0]
Case 6
digits = [1,0,0]
Case 7
digits = [8,9,9]
Case 8
digits = [1,9,9]
Case 9
digits = [9,9,9,9,9]
Case 10
digits = [5,6,7,8,9]