Plus One
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 zeros. Increment the large integer by one and return the resulting array of digits.
Plus One
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 zeros. Increment the large integer by one and return the resulting array of digits.
Example 1
Input: digits = [1,2,3] Output: [1,2,4]
Example 2
Input: digits = [4,3,2,1] Output: [4,3,2,2]
Show hint
Start from the end. Add 1, handle carry. If carry persists, add new digit at beginning.
Sign in to submit, save progress and mark problems as solved. You can still run your code.
Loading editor...
[1,2,3]
[1,2,4]