[leetcode]Plus One

Given a non-empty array of digits representing a non-negative integer, plus one to the integer.

The digits are stored such that the most significant digit is at the head of the list, and each element in the array contain a single digit.

You may assume the integer does not contain any leading zero, except the number 0 itself.

Example 1:

Input: [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.

分析：

返回数组加一后的数组，这里要主要是考虑到进位的情况。从数组的末位开始，依次向前判断每一位是否为9，若为9，该位置0，前一位加一；否则孩位加一，直接返回即可。最后判断加一后的数组首位是否为0，若为0，需在首位补1。

class Solution {
public:
    vector<int> plusOne(vector<int> &digits) {
        int n = digits.size();
        for (int i = n - 1; i >= 0; --i) {
            if (digits[i] == 9)
                digits[i] = 0; 
            else {
                digits[i] += 1;
                return digits;
            }
        }
        if (digits.front() == 0) 
            digits.insert(digits.begin(), 1);
        return digits;
    }
};