题面:Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.
You may assume the integer do not contain any leading zero, except the number 0 itself.
The digits are stored such that the most significant digit is at the head of the list.
题解:用一个数组表示一个数,最高位在前面,求写一个函数使其加一后继续可以表示。由于只有当所有位数全是9的时候,数组才会扩长一位,只要有一位不是9,即可将那位加一,是9的变成0 即可。
代码:
class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
for(int i=digits.size()-1;i>=0;i--){
if(digits[i]==9)
digits[i]=0;
else
{
digits[i]++;
return digits;
}
}
digits[0]=1;
digits.push_back(0);
return digits;
}
};