[leetcode] 66. Plus One

标签：判断   turn   can   bsp   present   ret   lead   code   size   

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.

继续刷水题。。。：+1的高精度加法

用 carry 记录进位，最后要判断原数位数有没有扩展。

我的代码如下：

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

[leetcode] 66. Plus One

标签：判断   turn   can   bsp   present   ret   lead   code   size   

原文地址：http://www.cnblogs.com/zmj97/p/7554286.html