本文共 515 字，大约阅读时间需要 1 分钟。

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

class Solution {public:    vector
   
     plusOne(vector
    
      &digits) {        vector
     
       re;        int carry = 1;        for(int i = digits.size() - 1; i >= 0; --i)        {            int cur = digits[i];            re.push_back((cur + carry) % 10);            carry = (cur + carry) / 10;        }        if(carry)        re.push_back(carry);        vector
      
        vec(re.rbegin(),re.rend());        return vec;    }};
      
     
    
   

转载地址：http://ielji.baihongyu.com/