Simple C++ solution


  • 0
    S
    class Solution {
    public:
        vector<int> plusOne(vector<int>& digits) {
            int result = 0;
            const int n = digits.size();
            for (int i = n - 1; i >= 0; --i){
                if (digits[i] < 9){
                    ++digits[i];
                    return digits;
                }
                digits[i] = 0;
            }
            digits.insert (digits.begin(), 1);
            return digits;
        }
    };
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.