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设计的，用C++的话还要考虑转化和进位，在java只需要用BigDecimal进行大数精确运算即可。
public String multiply(String num1, String num2) {
BigDecimal n1 = new BigDecimal(num1);
BigDecimal n2 = new BigDecimal(num2);
return n1.multiply(n2).toString();
}
问题描述 Given two numbers represented as strings, return mul...
#### [https://leetcode-cn.com/problems/multiply-strings]4...
题目链接 https://leetcode.com/problems/multiply-strings/ 解题思路...
题目描述 https://leetcode-cn.com/problems/multiply-strings/ 解...
题目地址 https://leetcode.com/problems/multiply-strings/descr...
原题链接：https://leetcode-cn.com/problems/multiply-strings/de...
现附上代码：
题目描述 Given two non-negative integers num1 and num2 repres...
43. Multiply Strings 415. Add Strings
Given two non-negative integers num1 and num2 represented...
本文标题：LeetCode每日一题：multiply strings
本文链接：https://www.haomeiwen.com/subject/oxzqcxtx.html
网友评论