Algorithm/LeetCode/source/PlusOne.cpp at master · tdm1223/Algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
// PlusOne
// 2021.12.28
// Easy

class Solution
{
public:
    vector<int> plusOne(vector<int>& digits)
    {
        int len = digits.size();
        digits[len - 1] = digits[len - 1] + 1;

        if (digits[len - 1] < 10)
        {
            return digits;
        }

        for (int i = len - 1; i > 0; i--)
        {
            if (digits[i] > 9)
            {
                carry(i, digits);
            }
        }

        if (digits[0] > 9)
        {
            vector<int> newDigits(len + 1, 0);
            newDigits[0] = 1;
            return newDigits;
        }
        return digits;
    }

    void carry(int index, vector<int>& digits)
    {
        digits[index] = 0;
        digits[index - 1] = digits[index - 1] + 1;
    }
};