前两天乐视二面,上来就让我写大数相乘,没写出来,回来一查好常见的题!!
总结一下:
1.逐位相乘处理进位法
思路:用char数组处理每一位,乘积是逐位相乘,也就是aibj,结果加入到积C的第i+j位,最后处理进位即可,例如:A =17 = 1*10 + 7 = (7,1)最后是十进制的幂表示法,幂次是从低位到高位,以下同。B=25 = 2*10 + 5 = (5, 2);C = A * B = (7 * 5, 1 * 5 + 2 * 7, 1 * 2) = (35, 19, 2) = (5, 22, 2) = (5, 2. 4)=425。
package prepare;
import java.util.*;
public class Main {
public static void main(String[] args) {
String str1 = "23456789009877666555544444";
String str2 = "346587436598437594375943875943875";
int len1 = str1.length();
int len2 = str2.length();
char[] s1 = str1.toCharArray();
char[] s2 = str2.toCharArray();
// 高低位对调
covertdata(s1, len1);
covertdata(s2, len2);
System.out.println("乘数:"+str1);
System.out.println("乘数:"+str2);
multiply(s1, len1, s2, len2);
}
<span style="white-space:pre"> </span>//也可以用栈进行翻转
public static void covertdata(char data[], int len) {
for (int i = 0; i < len / 2; i++) {
data[i] += data[len - 1 - i];
data[len - 1 - i] = (char) (data[i] - data[len - 1 - i]);
data[i] = (char) (data[i] - data[len - 1 - i]);
}
}
public static void multiply(char a[], int alen, char b[], int blen) {
int csize = alen + blen + 3;
int[] c = new int[csize];
for (int i = 0; i < csize; i++) {
c[i] = 0;
}
// 对齐逐位相乘
for (int j = 0; j < blen; j++) {
for (int i = 0; i < alen; i++) {
c[i + j] += Integer.parseInt(String.valueOf(a[i]))* Integer.parseInt(String.valueOf(b[j]));
}
}
int m = 0;
// 进位处理
for (m = 0; m < csize; m++) {
int carry = c[m] / 10;
c[m] = c[m] % 10;
if (carry > 0)
c[m + 1] += carry;
}
// 找到最高位
for (m = csize - 1; m >= 0;) {
if (c[m] > 0)
break;
m--;
}
// 由最高位开始打印乘积
System.out.print("乘积:");
for (int n = 0; n <= m; n++) {
System.out.print(c[m - n]);
}
System.out.println("");
}
}
2.分治法