感谢 https://www.bilibili.com/video/av48031413?from=search&seid=14212481088565371872
'''
leetcode 43. 字符串相乘
给定两个以字符串形式表示的非负整数 num1 和 num2,返回 num1 和 num2 的乘积,它们的乘积也表示为字符串形式。
输入: num1 = "123", num2 = "456"
输出: "56088"
算法:在处理两个位数较高的int类型整数相乘时,如果直接使用整数的乘法可能会产生溢出
故而转换成字符串的处理方法,对每个字符分别做处理,转换成每个位数上的1位整数相乘,最后将结果相加
'''
class Solution:
def multiply(self, num1: str, num2: str) -> str:
if len(num2)==0 or len(num1)==0:
return num1 or num2
if num1=='0' or num2=='0':
return '0'
# output=[[0 for _ in range(len(num1)+len(num2)-1)] for i in range(len(num2))]
result=[0 for _ in range(len(num1)+len(num2)-1)]
# 进位之前的逐个字符相乘结果
for j in range(len(num1)-1,-1,-1):
for i in range(len(num2)-1,-1,-1):
result[i+j]+=int(num1[j])*int(num2[i])
# print(j,result)
save = 0
step_forward = 0
# for p in range(len(output[0])-1,-1,-1):
# for k in range(len(output)):
# result[p]+=output[k][p]
# # print(result)
# # 进位前的结果,接下来从后向前依次进位
#
for p in range(len(result)-1,-1,-1):
if result[p]>=10:
save=result[p]%10
step_forward=result[p]//10
result[p]=save
# print(q,step_forward)
if p>=1:
result[p-1]+=step_forward
else:
step_forward=0
# print(step_forward)
while(step_forward):
if step_forward>=10:
save=step_forward%10
step_forward=step_forward//10
result.insert(0,save)
else:
result.insert(0,step_forward)
break
# print(result)
result=map(lambda x:str(x),result)
return "".join(result)
if __name__=="__main__":
print(Solution().multiply('1234','25'))