对于非负整数 X
而言,X
的数组形式是每位数字按从左到右的顺序形成的数组。例如,如果 X = 1231
,那么其数组形式为 [1,2,3,1]
。
给定非负整数 X
的数组形式 A
,返回整数 X+K
的数组形式。
示例 1:
输入:A = [1,2,0,0], K = 34 输出:[1,2,3,4] 解释:1200 + 34 = 1234
示例 2:
输入:A = [2,7,4], K = 181 输出:[4,5,5] 解释:274 + 181 = 455
示例 3:
输入:A = [2,1,5], K = 806 输出:[1,0,2,1] 解释:215 + 806 = 1021
示例 4:
输入:A = [9,9,9,9,9,9,9,9,9,9], K = 1 输出:[1,0,0,0,0,0,0,0,0,0,0] 解释:9999999999 + 1 = 10000000000
提示:
1 <= A.length <= 10000
0 <= A[i] <= 9
0 <= K <= 10000
- 如果
A.length > 1
,那么A[0] != 0
class Solution {
public:
vector<int> addToArrayForm(vector<int>& A, int K) {
if (A.empty() || K < 0) {
return A;
}
string str;
str.resize(A.size());
for (int i = 0; i < A.size(); ++i) {
str[i] = A[i] + '0';
}
string st = to_string(K);
int carry = 0;
if (str.size() < st.size()) {
swap(str, st);
}
AddStr(str, st, carry);
vector<int> res(str.size() + carry, 0);
int i = 0;
if (carry) {
res[i++] = carry;
}
for (auto ch : str) {
res[i++] = ch - '0';
}
return res;
}
void AddStr(string& str, const string& st, int& carry) {
int index = str.size() - 1;
for (int i = st.size() - 1; i >= 0; --i) {
int sum = str[index] - '0' + (st[i] - '0') + carry;
str[index--] = sum % 10 + '0';
carry = sum / 10;
}
while (index >= 0) {
int sum = str[index] - '0' + carry;
str[index--] = sum % 10 + '0';
carry = sum / 10;
if (carry == 0) {
return ;
}
}
}
};