class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
int add = 1;
int n = digits.size();
for (int i = n - 1; i >= 0; i--) {
if (add == 0) {
return digits;
}
add = (digits[i] + 1) / 10;
digits[i] = (digits[i] + 1) % 10;
}
if (add == 0) {
return digits;
}
vector<int> ans(n + 1);
ans[0] = 1;
return ans;
}
};