对于非负整数 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:
def addToArrayForm(self, A: 'List[int]', K: 'int') -> 'List[int]':
knum = []
res = []
while K != 0:
knum.insert(0, K % 10)
K //= 10
lenK = len(knum)
lenA = len(A)
i, j = lenA - 1, lenK - 1
carry = 0
while i >= 0 and j >= 0:
result = (A[i] + knum[j] + carry) % 10
carry = (A[i] + knum[j] + carry) // 10
res.insert(0, result)
i -= 1
j -= 1
if j < 0:
while i >= 0:
result = (A[i] + carry) % 10
carry = (A[i] + carry) // 10
res.insert(0, result)
i -= 1
if i < 0:
while j >= 0:
result = (knum[j] + carry) % 10
carry = (knum[j] + carry) // 10
res.insert(0, result)
j -= 1
if carry != 0:
res.insert(0, carry)
return res
# 可以不用转化K,直接计算
def addToArrayForm2(self, A: 'List[int]', K: 'int') -> 'List[int]':
n = len(A)
i = n - 1
while i >= 0 and K > 0:
temp = A[i] + K % 10
A[i] = temp % 10
K //= 10
K += temp // 10
i -= 1
while K > 0:
A.insert(0, K % 10)
K //= 10
return A
if __name__ == '__main__':
s = Solution()
A = [1,2,0,0]
K = 9999941
print(s.addToArrayForm2(A,K))