[leetcode] 66. Plus One : https://leetcode.com/problems/plus-one/

Plus one.cc

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