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.
- Converting the input string to integer is NOT allowed.
- You should NOT use internal library such as BigInteger.
思路:n * m size的乘法,最后结果只能是n+m, 然后用数组记录每个位子的sum,然后最后用carry反向计算一下,最后去掉头部的0;注意res的index是i + j + 1; 因为最后一位是n1 + n2 - 1,所以需要+1;
class Solution {
public String multiply(String num1, String num2) {
int n1 = num1.length();
int n2 = num2.length();
int[] res = new int[n1 + n2];
for(int i = n1 - 1; i >= 0; i--) {
for(int j = n2 - 1; j >= 0; j--) {
res[i + j + 1] += (num1.charAt(i) - '0') * (num2.charAt(j) - '0');
}
}
// calcualte carry;
int carry = 0;
for(int i = res.length - 1; i >= 0; i--) {
int sum = res[i] + carry;
carry = sum / 10;
res[i] = sum % 10;
}
StringBuilder sb = new StringBuilder();
for(int i = 0; i < res.length; i++) {
if(res[i] == 0 && sb.length() == 0) {
continue;
} else {
sb.append(res[i]);
}
}
return sb.length() == 0 ? "0" : sb.toString();
}
}