题目来源【Leetcode】
Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.
You may assume the integer do not contain any leading zero, except the number 0 itself.
The digits are stored such that the most significant digit is at the head of the list.
这道题就是把一个数的每一位放在一个数组里面，然后加一，最后的得到数每一位也放在数组里
class Solution {
public:
vector<int> plusOne(
vector<int>& digits) {
int s = digits.size();
for (
int i = s -
1; i >=
0; --i){
if (digits[i] ==
9)digits[i] =
0;
else{
digits[i]++;
return digits;
}
}
digits.push_back(
0);
digits[
0] =
1;
return digits;
}
};
