mirror of
https://github.com/lWolvesl/leetcode.git
synced 2026-01-12 18:08:38 +08:00
19 lines
437 B
C++
19 lines
437 B
C++
#include <vector>
|
|
|
|
class Solution {
|
|
public:
|
|
std::vector<int> plusOne(std::vector<int>& digits) {
|
|
for(int i = digits.size()-1;i>=0;i--){
|
|
if(digits[i] == 9){
|
|
digits[i] = 0;
|
|
if (i == 0) {
|
|
digits.insert(digits.begin(),1);
|
|
}
|
|
continue;
|
|
}
|
|
digits[i]++;
|
|
break;
|
|
}
|
|
return digits;
|
|
}
|
|
}; |