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"
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.
概要:就是两个数相乘,输出结果,只不过数字很大很大,都是用 String 存储的。也就是传说中的大数相乘
别人的代码1:
public String multiply(String num1, String num2) {
int n1 = num1.length(), n2 = num2.length();
int[] products = new int[n1 + n2];
for (int i = n1 - 1; i >= 0; i--) {
for (int j = n2 - 1; j >= 0; j--) {
int d1 = num1.charAt(i) - '0';
int d2 = num2.charAt(j) - '0';
products[i + j + 1] += d1 * d2;
}
}
int carry = 0; // 表示进位
for (int i = products.length - 1; i >= 0; i--) {
int tmp = (products[i] + carry) % 10;
carry = (products[i] + carry) / 10; //第i位向第i-1位的进位值
products[i] = tmp;
}
StringBuilder sb = new StringBuilder();
for (int num : products) sb.append(num);
while (sb.length() != 0 && sb.charAt(0) == '0') sb.deleteCharAt(0);
return sb.length() == 0 ? "0" : sb.toString();
}
- 先对各个digit进行乘法
- 然后int[] products中进行进位,再求和
- 得到最终的结果
别人的代码2(蛮力解法):
我们就模仿我们在纸上做乘法的过程写出一个算法。
个位乘个位,得出一个数,然后个位乘十位,全部乘完以后,就再用十位乘以各个位。然后百位乘以各个位;
最后将每次得出的数相加。十位的结果要补 1 个 0 ,百位的结果要补两个 0 。
相加的话我们可以直接用之前的大数相加。直接看代码吧。
大数相乘:
public String multiply(String num1, String num2) {
if (num1.equals("0") || num2.equals("0")) {
return "0";
}
String ans = "0";
int index = 0; //记录当前是哪一位,便于后边补 0
for (int i = num2.length() - 1; i >= 0; i--) {
int carry = 0; //保存进位
String ans_part = ""; //直接用字符串保存每位乘出来的数
int m = num2.charAt(i) - '0';
//乘上每一位
for (int j = num1.length() - 1; j >= 0; j--) {
int n = num1.charAt(j) - '0';
int mul = m * n + carry;
ans_part = mul % 10 + "" + ans_part;
carry = mul / 10;
}
// 保证可能存在最高位进位
if (carry > 0) {
ans_part = carry + "" + ans_part;
}
//补 0
for (int k = 0; k < index; k++) {
ans_part = ans_part + "0";
}
index++;
//和之前的结果相加
ans = sumString(ans, ans_part);
}
return ans;
}
大数相加:
字符串形式的两个字符串代表的数进行加法:
//大数相加
private String sumString(String num1, String num2) {
int carry = 0;
int num1_index = num1.length() - 1;
int num2_index = num2.length() - 1;
String ans = "";
while (num1_index >= 0 || num2_index >= 0) {
int n1 = num1_index >= 0 ? num1.charAt(num1_index) - '0' : 0;
int n2 = num2_index >= 0 ? num2.charAt(num2_index) - '0' : 0;
int sum = n1 + n2 + carry;
carry = sum / 10;
ans = sum % 10 + "" + ans;
num1_index--;
num2_index--;
}
if (carry > 0) {
ans = carry + "" + ans;
}
return ans;
}