1
2
3
4
5
6
7
8
9
10
11
12
13
14
| class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
vector<int> res;
for (int n = size(digits), i = n - 1, c = 0; i >= 0 || c > 0; --i) {
int a = i >= 0 ? digits[i] : 0;
int b = i == n - 1;
int s = a + b + c;
res.push_back(s % 10);
c = s / 10;
}
return vector<int>(rbegin(res), rend(res));
}
};
|