Given a number represented as an array of digits, plus one to the number.
class Solution {
public:
vector<int> plusOne(vector<int> &digits) {
vector<int> re;
int carry = 1;
for(int i = digits.size() - 1; i >= 0; --i)
{
int cur = digits[i];
re.push_back((cur + carry) % 10);
carry = (cur + carry) / 10;
}
if(carry)
re.push_back(carry);
vector<int> vec(re.rbegin(),re.rend());
return vec;
}
};