Plus One

Posted by Bill on March 11, 2023

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 0’s.

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

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
 Example 1:

 Input: digits = [1,2,3]
 Output: [1,2,4]
 Explanation: The array represents the integer 123.
 Incrementing by one gives 123 + 1 = 124.
 Thus, the result should be [1,2,4].
 Example 2:

 Input: digits = [4,3,2,1]
 Output: [4,3,2,2]
 Explanation: The array represents the integer 4321.
 Incrementing by one gives 4321 + 1 = 4322.
 Thus, the result should be [4,3,2,2].
 Example 3:

 Input: digits = [9]
 Output: [1,0]
 Explanation: The array represents the integer 9.
 Incrementing by one gives 9 + 1 = 10.
 Thus, the result should be [1,0].

C++ Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
vector<int> plusOne(vector<int>& digits) {
    vector<int> ret;
    auto iter = digits.rbegin();
    int carry = 1;
    stack<int> myStack;
    while (iter != digits.rend()) {
        int val = *iter + carry;
        carry = val / 10;
        myStack.push(val % 10);
        iter++;
    }
    if (carry != 0) {
        myStack.push(carry);
    }
    while (!myStack.empty()) {
        ret.push_back(myStack.top());
        myStack.pop();
    }
    return ret;
}