Multiply Strings

最新推荐文章于 2020-09-26 06:12:01 发布

真水壶

最新推荐文章于 2020-09-26 06:12:01 发布

阅读量405

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/enjoyuseless/article/details/39960857

版权

leetcode 专栏收录该内容

154 篇文章 0 订阅

订阅专栏

Given two numbers represented as strings, return multiplication of the numbers as a string.

Note: The numbers can be arbitrarily large and are non-negative.

class Solution:
    # @param num1, a string
    # @param num2, a string
    # @return a string
    def multiply(self, num1, num2):
        return str(int(num1)*int(num2))

确定要放弃本次机会？

福利倒计时

: :

立减 ¥

普通VIP年卡可用

立即使用

真水壶

关注关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
复制链接

分享到 QQ

分享到新浪微博

扫一扫

专栏目录

Leetcode 43. Multiply Strings--两个很长的数字字符串相乘，不能使用大数乘法库或直接转换成整型计算

Top5软件工程硕士，先后在京东、字节从事多年Java后端开发、实时和离线大数据开发

01-16

836

Given two non-negative integersnum1andnum2represented as strings, return the product ofnum1andnum2, also represented as a string. Example 1: Input: num1 = "2", num2 = "3" Output: "6" Exampl...

LeetCode 刷题记录 43. Multiply Strings

dldldl1994的博客

09-21

129

题目： Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string. Example 1: Input: num1 = “2”, num2 = “3” Output: “6” Exampl...

参与评论您还未登录，请先登录后发表或查看评论

multiply-strings

weixin_36909758的博客

07-03

229

【题目描述】Given two numbers represented as strings, return multiplication of the numbers as a string. Note: The numbers can be arbitrarily large and are non-negative. 给两个字符串表示的数字，计算他们的乘积。【解题思路】手写一个大数乘法，先...

java-leetcode题解之Multiply Strings.java

最新发布

10-23

java java_leetcode题解之Multiply Strings.java

Leetcode 43. Multiply Strings （python+cpp）

qq_37821701的博客

09-26

249

Leetcode 43. Multiply Strings题目解法：题目解法： class Solution: def multiply(self, num1: str, num2: str) -> str: if num1=='0' or num2=='0': return '0' product = [0]*(len(num1)+len(num2)) pos = len(product)-1

LeetCode 43. 字符串相乘（Multiply Strings）

tan137310853的博客

02-07

197

题目描述: 给定两个以字符串形式表示的非负整数 num1 和 num2，返回 num1 和 num2 的乘积，它们的乘积也表示为字符串形式。示例 1: 输入: num1 = "2", num2 = "3" 输出: "6" 示例 2: 输入: num1 = "123", num2 = "456" 输出: "56088" 说明： num1 和 num2 的长度小于110。

LeetCode-multiply-strings

六月二十七的博客

05-31

333

Given two numbers represented as strings, return multiplication of the numbers as a string. Note: The numbers can be arbitrarily large and are non-negative. public class Solution { public Strin...

高精度加法乘法string

08-18

您可以使用字符串来实现高精度的加法和乘法运。下面是一个示例的实现代码： ``` def addStrings(num1, num2): # 将字符串转换为整数列表 n1 [int(x) for in num1] n = [int(x) for x in num2] # 对齐两个整数列表的长度 if len(n1) < len(n2): n1 = [0] * (len(n2) - len(n1)) + n1 else: n2 = [0] * (len(n1) - len(n2)) + n2 # 逐位相加 carry = 0 res = [] for i in range(len(n1)-1, -1, -1): total = n1[i] + n2[i] + carry carry = total // 10 res.append(str(total % 10)) # 如果还有进位，需要额外加一位 if carry: res.append(str(carry)) # 翻转并返回结果 return ''.join(res[::-1]) def multiplyStrings(num1, num2): # 将字符串转换为整数列表 n1 = [int(x) for x in num1][::-1] n2 = [int(x) for x in num2][::-1] # 初始化结果列表 res = [0] * (len(n1) + len(n2)) # 逐位相乘 for i in range(len(n1)): for j in range(len(n2)): res[i+j] += n1[i] * n2[j] res[i+j+1] += res[i+j] // 10 res[i+j] %= 10 # 去除前导零 while len(res) > 1 and res[-1] == 0: res.pop() # 翻转并返回结果 return ''.join(str(x) for x in res[::-1]) ``` 您可以使用`addStrings`函数进行两个字符串的加法运算，使用`multiplyStrings`函数进行两个字符串的乘法运算。例如： ```python num1 = "123456789" num2 = "987654321" print(addStrings(num1, num2)) # 输出：1111111110 print(multiplyStrings(num1, num2)) # 输出：121932631112635269 ``` 这样就可以实现高精度的加法和乘法运算了。希望对您有帮助！