【Plus One】cpp

题目：

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

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

代码：

class Solution {
public:
    vector<int> plusOne(vector<int>& digits) {
            int carry = ;
            for (std::vector<int>::reverse_iterator i = digits.rbegin(); i != digits.rend() && carry>; ++i)
            {
                const int tmp = *i+carry;
                *i = tmp%;
                carry = tmp/;
            }
            if ( carry > ) digits.insert(digits.begin(), carry);
            return digits;
    }
};

Tips:

高精度加法。

利用reverse_iterator来反向迭代vector。

========================================================

这种高精度的不要忘记最后一个的进位。

class Solution {
public:
    vector<int> plusOne(vector<int>& digits) {
            vector<int> ret;
            int carry = ;
            for ( int i=digits.size()-; i>=; --i )
            {
                int curr = digits[i] + carry;
                carry = curr / ;
                curr = curr % ;
                ret.insert(ret.begin(), curr);
            }
            if ( carry!= ) ret.insert(ret.begin(), carry);
            return ret;
    }
};