66. Plus One 加一 LeetCode
66. Plus One 加一 LeetCode
难度:easy
问题描述:
Given a non-empty array of decimal digits representing a non-negative integer, increment 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 contains a single digit.
You may assume the integer does not contain any leading zero, except the number 0 itself.
中文:大概意思就是,给你一个整数数组,每个整数都是10以内的整数,即都小于10,让你把这个整数数组看成一整数,加上1,然后还是返回拆分后的数组。
Example 1:
Input: digits = [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.
Example 2:
Input: digits = [4,3,2,1]
Output: [4,3,2,2]
Explanation: The array represents the integer 4321.
Example 3:
Input: digits = [0]
Output: [1]
思路:既然是给最后一个数加一,就从后往前看,并存在两种情况,一是最后一位数=9,二是最后一位数!=9.
注意:对数组进行操作而不是将数组变换成整数,是因为防止数太大,越界。
// C++
class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
int i = digits.size() - 1;
while(i>=0)
{
if(digits[i] != 9)
{
digits[i] = digits[i]+1;
break;
}
if(digits[i] == 9)
{
digits[i] = 0;
if(i == 0)
{
digits.insert(digits.begin(),1);
}
i--;
}
}
return digits;
}
};