CPlusPlus_LeetcodeProblems/0066. Plus One.cpp at master · luispc111/CPlusPlus_LeetcodeProblems · 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
class Solution {
public:
    vector<int> plusOne(vector<int>& digits) {
        int final = digits.size()-1;

        if(digits[final] == 9 && final != 0){
            while(digits[final] == 9 && final != 0){
                digits[final] = 0;
                final--;
            }
            if(final == 0 && digits[final] == 9){
                digits[0] = 1;
                digits.insert(digits.end(), 0);
            }
            else{
                digits[final]++;
            }
        }
        else{
            if(final == 0 && digits[final] == 9){
                digits[0] = 1;
                digits.insert(digits.end(), 0);
            }
            else{
                digits[final]++;
            }
        }

        return digits;
    }
};