文章作者:Tyan
博客:noahsnail.com | CSDN | 简书
1. Description
2. Solution
class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
int length = digits.size();
int index = length - 1;
while(index >= 0) {
int sum = digits[index] + 1;
if(sum == 10) {
digits[index] = 0;
index--;
}
else {
digits[index] = sum;
return digits;
}
}
digits.insert(digits.begin(), 1);
return digits;
}
};