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

[思路及要点]

题目很简单，记得循环时候没有进位的话就可以及时跳出了。

[代码]

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