LeetCodeNo.66
Given anon-negative number represented as an array of digits, plus one to the number.
The digitsare stored such that the most significant digit is at the head of the list.
用字符串模拟非负整数+1的运算。
我设置了一个flag变量作为进位信号。
class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
int flag=1;
for(int i=digits.size()-1;i>=0;i--){
if(digits[i]==9&&flag){
digits[i]=0;
flag=1;
}
else{
digits[i]+=flag;
flag=0;
}
}
if(flag){
digits.insert(digits.begin(),1);
}
return digits;
}
};