问题描述:
Given a non-empty array of digits representing a non-negative integer, plus one to the integer.
The digits are stored such that the most significant digit is at the head of the list, and each element in the array contain a single digit.
You may assume the integer does not contain any leading zero, except the number 0 itself.
Example 1:
Input: [1,2,3] Output: [1,2,4] Explanation: The array represents the integer 123.
Example 2:
Input: [4,3,2,1] Output: [4,3,2,2] Explanation: The array represents the integer 4321.
源码:
很简单的题目,用一个carry保存进位,当需要进位的时候carry设置为1,当前digits[i]=0。注意如果到最后还有进位的话,在前面插一个1。
class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
int n = digits.size();
int carry = 0;
for(int i=n-1; i>=0; i--){
if(digits[i]<9){
digits[i]++;
carry=0;
break;
}else{
digits[i] = 0;
carry=1;
}
}
if(carry) digits.insert(digits.begin(), 1);
return digits;
}
};