[Leetcode] 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.

思路：

Easy级别的题目，直接上代码。如果说这道题目能考察什么能力，我感觉就在于考察面试者能不能把代码写的尽可能的简洁。

代码：

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