版权声明:本文为博主原创文章,遵循 CC 4.0 BY 版权协议,转载请附上原文出处链接和本声明。
本文链接:https://blog.csdn.net/shiliang97/article/details/103180946
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.
来源:力扣(LeetCode) 链接:https://leetcode-cn.com/problems/plus-one 著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
if(digits.size()<1){
digits.push_back(1);
return digits;
}digits[digits.size()-1]+=1;
for(int i=digits.size()-1;i>0;i--){
if(digits[i]>9){
digits[i-1]++;
digits[i]-=10;
}else{
break;
}
}if(digits[0]>9){
digits[0]-=10;
digits.insert(digits.begin(),1);
}
return digits;
}
};
class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
for (int i = (int)digits.size() - 1; i >= 0; i--) {
if (digits[i] == 9) {
digits[i] = 0;
}
else {
digits[i]++;
break;
}
}
if (digits[0] == 0) {
digits.push_back(0);
digits[0] = 1;
}
return digits;
}
};