题目链接:
题目:
Given two non-negative integers
num1
andnum2
represented as strings, return the product ofnum1
andnum2
, also represented as a string.Example 1:
Input: num1 = "2", num2 = "3" Output: "6"
Example 2:
Input: num1 = "123", num2 = "456" Output: "56088"
Note:
- The length of both
num1
andnum2
is < 110.- Both
num1
andnum2
contain only digits0-9
.- Both
num1
andnum2
do not contain any leading zero, except the number 0 itself.- You must not use any built-in BigInteger library or convert the inputs to integer directly.
题目分析:
给定两个字符串,分别表示两个十进制数,求两个十进制数相乘。
解题思路:
和考虑字符串相加类似,模拟具体的乘法过程,乘法比加法复杂。
首先要知道乘法的一些性质。具体可看下图:
特别注意,到最后返回相乘结果时,如果第一位是0,说明不能返回包括第一位(不然输出的会有前导零)。
然后考虑特殊情况,如果两个字符串中,有一个是0,那结果一定是0。
AC代码:
class Solution {
public:
string multiply(string num1, string num2) {
if (num1[0] == '0' || num2[0] == '0')
return "0";
string num(num1.size() + num2.size(), '0');
for (int i = num1.size() - 1; 0 <= i; --i) {
int carry = 0;
for (int j = num2.size() - 1; 0 <= j; --j) {
int tmp = (num[i + j + 1] - '0') + (num1[i] - '0') * (num2[j] - '0') + carry;
num[i + j + 1] = tmp % 10 + '0';
carry = tmp / 10;
}
num[i] += carry;
}
return num[0] == '0' ? num.substr(1) : num;
}
};