leetcode 66. Plus One

 1 vector<int> plusOne(vector<int> &digits) 
 2     {
 3         int carry = 1;
 4         reverse(digits.begin(), digits.end());
 5         for (int i = 0; i < digits.size(); i++)
 6         {
 7             digits[i] += carry;
 8             if (digits[i] > 9)
 9             {
10                 digits[i] -= 10;
11                 carry = 1;
12             }
13             else
14             {
15                 carry = 0;
16                 break;
17             }
18         }
19         if (carry > 0)
20             digits.push_back(carry);
21         reverse(digits.begin(), digits.end());
22         
23         return digits;
24     }