Given
a non-negative number represented as an array of digits, plus one to the
number.
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 len=digits.size();
vector<
int> result;
if(len==
0)
return result;
int add=
1;
int index=len-
1;
while(index>=
0 || add==
1)
{
int sum=add;
if(index>=
0) sum=sum+digits[index--];
result.push_back(sum%
10);
add=sum/
10;
}
//reverse
vector<
int> result2;
len=result.size();
for(
int i=
0;i<len;i++)
result2.push_back(result[len-i-
1]);
return result2;
}
};
