LeetCode Plus One

Plus One

Given a number represented as an array of digits, plus one to the number.

Solution:

class Solution {
public:
    vector<int> plusOne(vector<int> &digits) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        reverse(digits.begin(),digits.end());
        int carry=1;
        for(int i=0;i<digits.size();++i){
            digits[i]+=carry;
            carry=digits[i]/10;
            digits[i]%=10;
        }
        if(carry)
            digits.push_back(carry);
        reverse(digits.begin(),digits.end());
        return digits;
    }
};