[leetCode] Plus One

class Solution {
public:
vector<int> plusOne(vector<int> &digits) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<int> result(digits.size()+1,0);
int carry=0;
for(int i=digits.size()-1;i>=0;i--)
{
if(i==digits.size()-1)
{
result[i+1]=(digits.at(i)+1)%10;
carry=(digits.at(i)+1)/10;
}
else{
result[i+1]=(digits.at(i)+carry)%10;
carry=(digits.at(i)+carry)/10;
}
}
if(carry==1){
result[0]=1;
}
else{
//delete result[0]
for(int i=0;i<digits.size();i++)
{
result[i]=result[i+1];
}
result.pop_back();
}
return result;
}
};

class Solution {
public:
vector<int> plusOne(vector<int> &digits) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<int> result(digits.size(),0);
int carry=0;
for(int i=digits.size()-1;i>=0;i--)
{
if(i==digits.size()-1)
{
result[i]=(digits.at(i)+1)%10;
carry=(digits.at(i)+1)/10;
}
else{
result[i]=(digits.at(i)+carry)%10;
carry=(digits.at(i)+carry)/10;
}
}
if(carry==1){
result.insert(result.begin(),carry);
}
return result;
}
};