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.

测试代码（c++）：

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

性能：

参考答案（python）：

class Solution(object):
    def plusOne(self, digits):
        """
        :type digits: List[int]
        :rtype: List[int]
        """
        num = 0
        for i in range(len(digits)):
            num += digits[i] * pow(10, (len(digits)-1-i))
        return [int(i) for i in str(num+1)]        

性能：