这道题,解题思路参考的是这两个人的。https://blog.csdn.net/qq_14821023/article/details/50822207和https://blog.csdn.net/qq_32199531/article/details/52760362
我觉得这个人的图很好:
观看上图,它描述的是我们计算乘法的过程。仔细分析可以发现,对于原来在上面字符串中下标为1的“2”和在下面字符串中下标为0的“4”的相乘结果08出现在了最后的乘法结果字符串的下标1和2处。这一结果对其他下标的数字同样成立:下标i和下标j相乘的高位结果位于下标i+j处,低位位于下标i+j+1处。
题目如下:
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.
人家的解决办法如下:记住
package test;
public class LC43Try1
{
public String multiply(String num1, String num2)
{
num1=new StringBuilder(num1).reverse().toString();
num2=new StringBuilder(num2).reverse().toString();
int[] b=new int[num1.length()+num2.length()];
//先获取对应位相乘,不考虑进位。
for(int i=0;i<num1.length();i++){
for(int j=0;j<num2.length();j++){
b[i+j]+=(num1.charAt(i)-'0')*(num2.charAt(j)-'0');
}
}
//处理进位
for(int i=0;i<num1.length()+num2.length();i++){
if(b[i]>9){
b[i+1]+=b[i]/10;
b[i]%=10;
}
}
StringBuilder strbuilder=new StringBuilder();
for(int i=num1.length()+num2.length()-1;i>=0;i--){
strbuilder.append(b[i]);
}
while(strbuilder.charAt(0)=='0'&&strbuilder.length()>1){
strbuilder.deleteCharAt(0);
}
return strbuilder.toString();
}
}
class Solution {
public String multiply(String num1, String num2) {
if(num1.equals("0") || num2.equals("0")){
return "0";
}
char[] s1 = num1.toCharArray(), s2 = num2.toCharArray();
int[] midres = new int[s1.length + s2.length - 1];
for(int i = 0; i < s1.length; i++){// caculate every bit's number
for(int j = 0; j < s2.length; j++){
midres[i + j] += (s1[i] - '0') * (s2[j] - '0');
}
}
StringBuilder res = new StringBuilder();// convert to real number
int overflow = 0;
for(int i = s1.length + s2.length - 2; i >= 0; i--){
midres[i] += overflow;
overflow = midres[i] / 10;
res.append((char)((midres[i] % 10) + '0'));
}
if(overflow > 0){
res.append((char)((overflow) + '0'));
}
return res.reverse().toString();
}
}
哈哈