#407 Plus One

题目描述：

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.

Have you met this question in a real interview? 

Yes

Example

Given [1,2,3] which represents 123, return [1,2,4].

Given [9,9,9] which represents 999, return [1,0,0,0].

题目思路：

这题就主要用加法准则来做，从最小的一位开始加，然后记录每一位加完的carry，加到前一位中。最后，如果carry不为0，则在最高位额外push 1.

Mycode（AC = 27ms）：

class Solution {
public:
    /**
     * @param digits a number represented as an array of digits
     * @return the result
     */
    vector<int> plusOne(vector<int>& digits) {
        // Write your code here
        vector<int> sum;
        int carry = 1;
        
        // compute each digit from LSB and the carry for each digit
        for (int i = digits.size() - 1; i >= 0; i--) {
            sum.push_back((digits[i] + carry) % 10);
            carry = (digits[i] + carry) / 10;
        }
        
        // if carry is 1, then push the 1
        if (carry == 1) {
            sum.push_back(1);
        }
        
        reverse(sum.begin(), sum.end());
        return sum;
    }
};