LeetCode 66 - Plus One

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.

My Code

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

Runtime: 600 ms