Plus One
Easy
Array
Math
Carry
You are given a large integer represented as an integer array digits, where each digits[i] is the ith 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 zero, except the number 0 itself. Increment the large integer by one and return the resulting array of digits.
Examples:
Input:
[1,2,3]Output:
[1,2,4]Explanation: The array represents the integer 123. Incrementing by one gives 123 + 1 = 124.
Input:
[4,3,2,1]Output:
[4,3,2,2]Explanation: The array represents the integer 4321. Incrementing by one gives 4321 + 1 = 4322.
Input:
[9]Output:
[1,0]Explanation: The array represents the integer 9. Incrementing by one gives 9 + 1 = 10.
Constraints:
- 1 ≤ digits.length ≤ 100
- 0 ≤ digits[i] ≤ 9
- digits does not contain any leading zeros except for the number 0 itself.
Code Editor
Loading advanced editor...
Console Output
Ready to execute
Click "Run Code" to see your output here