Plus One -- leetcode

标签：leetcode   面试   plus   

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) {
        if (digits.empty())
            return digits;
        
        int carry = 1;
        for (int i=digits.size()-1; i>=0 && carry; i--) {
            int sum = digits[i] + carry;
            carry = sum / 10;
            digits[i] = sum % 10;
        }
        
        if (carry)
            digits.insert(digits.begin(), carry);
            
        return digits;
    }
};

Plus One -- leetcode

标签：leetcode   面试   plus   

原文地址：http://blog.csdn.net/elton_xiao/article/details/44888751