Leetcode#66 Plus One

原题地址

简单模拟

代码：

vector<int> plusOne(vector<int> &digits) {
        vector<int> sum(digits.size(), 0);
        int carry = 1;
        
        for (int i = digits.size() - 1; i >= 0; i--) {
            sum[digits.size() - 1 - i] = (digits[i] + carry) % 10;
            carry = (digits[i] + carry) / 10;
        }
        if (carry > 0)
            sum.push_back(1);
            
        for (int i = 0; i * 2 < sum.size(); i++)
            swap(sum[i], sum[sum.size() - 1 - i]);
            
        return sum;
}