[leetcode 66] Plus One

Given a non-negative number represented as an array of digits, plus one to the number.

The digits are stored such that the most significant digit is at the head of the list.

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