leetcode_75 Plus One

题目：

Given a non-empty array of digits representing a non-negative integer, increment 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 contains 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.

Example 2:

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

需要注意的是用例：

Input: [9,9,9,9]

Output: [1,0,0,0,0]

Explanation: The array represents the integer 10000.

代码如下：当没有进位时，便不再遍历，与第0位相加后，仍有进位，重新申请内存存储

class Solution {
public:
    vector<int> plusOne(vector<int>& digits) {
        int n = digits.size();
        int sum = 1;
        for(int i = n - 1; i >= 0; i--)
        {
            if(sum > 0){               /* span  */
                sum += digits[i];
                digits[i] = sum % 10;
                sum = sum /10;
            }
            else
                break;
        }
        if(sum > 0)
        {
            vector<int> res;
            res.push_back(sum);
            for(int i = 0; i < n; i++)
                res.push_back(digits[i]);
            return res;
        }
        return digits;
    }
};