Leetcode 66 Plus One
发布时间：2020-12-13 21:16:24 所属栏目：PHP教程 来源：网络整理
导读：Given a non-negative number represented as an array of digits,plus one to the number. The digits are stored such that the most significant digit is at the head of the list. 摹拟大数加法加1， 注意判断首位是不是有进位！ class Solution {publi
|
Given a non-negative number represented as an array of digits,plus one to the number. The digits are stored such that the most significant digit is at the head of the list. 摹拟大数加法加1，注意判断首位是不是有进位！ class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
int add=1;
for(int i=digits.size()⑴;i>=0;i--)
{
digits[i]=(digits[i]+add)%10;
if(digits[i]!=0) break;
}
if(digits[0]==0) digits.insert(digits.begin(),1);
return digits;
}
}; （编辑：李大同） 【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容! |