力扣题-12.30
力扣题1:66. 加一
解题思想:注意保存加一的flag逐位向前计算即可
class Solution(object):
def plusOne(self, digits):
"""
:type digits: List[int]
:rtype: List[int]
"""
flag = 1
for i in range(len(digits)-1,-1,-1):
if flag == 1 and digits[i] == 9:
digits[i] = 0
elif flag == 1 and digits[i] != 9:
digits[i] += 1
flag = 0
if flag == 1:
digits = [1] + digits
return digits
class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
int flag = 1;
for(int i = digits.size()-1; i >= 0; i -- ){
if(flag == 1 && digits[i] == 9){
digits[i] = 0;
}
else if(flag == 1 && digits[i] != 9){
digits[i] += 1;
flag = 0;
}
}
if (flag == 1) {
digits.insert(digits.begin(), 1);
}
return digits;
}
};