LeetCode: Plus One

class Solution {
public:
vector<int> plusOne(vector<int> &digits) {
int addition = 1;
for(int i = digits.size()-1;i>=0;i--){
int temp = (digits[i] + addition) / 10;
digits[i] = (digits[i] + addition)%10;
addition = temp;
if(temp == 0)break;
}
if(addition == 1){
digits.push_back(addition);
for(int i = digits.size()-1;i>=1;i--)
digits[i] = digits[i-1];
digits[0] = addition;
}
return digits;
}
};