Notes: | |
Given a number represented as an array of digits, plus one to the number. |
class Solution {
public:
vector<int> plusOne(vector<int> &digits) {
int carry = 1, N = digits.size();
for (int i = N-1; i >= 0 && carry; --i)
{
int sum = carry + digits[i];
carry = sum / 10;
digits[i] = sum % 10;
}
if (carry > 0) {
digits.insert(digits.begin(), carry);
}
return digits;
}
};