leetcode--66. Plus One

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 carry = 1;

for(int i = digits.size() - 1; i >= 0 && carry; --i){
carry = (++digits[i] %= 10) == 0;
}
if(carry){
digits[0] = 1;
digits.push_back(0);
}
return digits;
}
};