1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
| #include <vector>
using std::vector;
class Solution {
public:
vector<int> plusOne(vector<int> &digits)
{
int i, n = digits.size();
int carry = 1, sum;
for (i = n - 1; i >= 0; i--) {
if (carry == 0) {
break;
}
sum = digits[i] + carry;
digits[i] = sum % 10;
carry = sum / 10;
}
if (carry == 1) {
digits.insert(digits.begin(), 1);
}
return digits;
}
};
|
