LeetCode-66 加一

加一

class Solution {
public:
    vector<int> plusOne(vector<int>& digits) {
        int len=digits.size();
        vector<int> result;//倒着来
        vector<int> result_1;//正序
        //还是要倒着来吧
        int carry=1;
        for(int i=len-1;i>=0;--i)
        {
            int num=carry+digits[i];
            carry=num/10;
            num=num%10;
            result.push_back(num);
        }
        if(carry!=0)
            result.push_back(carry);
        for(auto it=result.rbegin();it!=result.rend();++it)
            result_1.push_back(*it);
        return result_1;
    }
};