66. Plus One

Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.

You may assume the integer do not contain any leading zero, except the number 0 itself.

The digits are stored such that the most significant digit is at the head of the list.

二刷时自己做出来的，跟之前两个string相加的做法类似，感觉可以总结出这种框架来了

class Solution {
public:
    vector<int> plusOne(vector<int>& digits) {
            if(digits.empty()) return digits;
            int len=digits.size()-1;
            int carry=1;
            for(int i=len;i>=0;i--)
            {
                int num=carry;
                num+=digits[i];
                carry=num/10;
                num%=10;
                digits[i]=num;
            }
            if(carry) digits.insert(digits.begin(),1);
            return digits;
    }

};