class Solution {
public:
vector<int> addToArrayForm(vector<int>& A, int K) {
vector<int> res;
int remain = 0;//用来存余数
for(int i = A.size() - 1; i >= 0; i --) {
int num = A[i];
//用最后一位加,保留余数
K += num;
remain = K % 10;
res.push_back(remain);
K /= 10;
}
//若K > 0,则K有多位
if(K != 0){
while(K > 9){
remain = K % 10;
res.push_back(remain);
K /= 10;
}
res.push_back(K);
}
reverse(res.begin(), res.end());
return res;
}
};
力扣989.数组形式的整数加法
最新推荐文章于 2021-03-24 16:06:27 发布