leetcodeOJ 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.

和leetcodeOJ67题有点像，一位一位数去处理，注意进位以及digits为空的情况

代码如下：

class Solution {
public:
    vector<int> plusOne(vector<int>& digits) {
        int n = digits.size();
        if(n == 0){
            digits.push_back(1);
            return digits;
        }
        
        if(digits[n-1] != 9){//最末尾不是9
            digits[n-1] += 1;
            return digits;
        }
        else{
            int c = 1;//进位
            digits[n-1] = 0;
            for(int i = n-2; i >= 0; i--){
                if(c == 0)
                    break;
                int temp = digits[i] + c;
                digits[i] = temp % 10;
                c = temp / 10;
            }
            if(c == 1)
                digits.insert(digits.begin(), 1);
        }
        return digits;
    }
};