java 两个大数字的相乘

最新推荐文章于 2024-01-02 14:00:13 发布

dk19870616

最新推荐文章于 2024-01-02 14:00:13 发布

阅读量360

点赞数

分类专栏： java 文章标签： java 开发工具

本文链接：https://blog.csdn.net/dk19870616/article/details/83979237

版权

java 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

public testMul() throws Exception {
String p1 = "123456789012345678901234123456789012345678901234";// "123456789012345678901234";
String p2 = "987654321098765432109876543210987654123456789012345678901234";// "987654321098765432109876543210987654";
int ASCII = 48;
char[] result = new char[p1.length() + p2.length()];
for (int i = 0; i < result.length; i++) {
result[i] = '0';
}
char ctemp = ' ';
char[] pc1 = p1.toCharArray();
for (int i = 0; i < pc1.length / 2; i++) {
ctemp = pc1[i];
pc1[i] = pc1[pc1.length - 1 - i];
pc1[pc1.length - 1 - i] = ctemp;
}
char[] pc2 = p2.toCharArray();
for (int i = 0; i < pc2.length / 2; i++) {
ctemp = pc2[i];
pc2[i] = pc2[pc2.length - 1 - i];
pc2[pc2.length - 1 - i] = ctemp;
}
int temp = 0;// 临时结果
int step = 0;// 进位
int time = 0;// 次数
int bit = 0;// 位数
for (char c1 : pc1) {
time = bit;
for (char c2 : pc2) {
temp = (c1 - ASCII) * (c2 - ASCII);
temp = temp + result[time] - ASCII;
if (temp > 9) {// 进位
int i = 0;
do {
result[time + i] = (char) (temp % 10 + ASCII);
step = (temp - temp % 10) / 10;
i++;
temp = result[time + i] - ASCII + step;
} while (temp > 9);
result[time + i] = (char) (temp + ASCII);
} else {
result[time] = (char) (temp + ASCII);
}
time++;
}
bit++;
}
System.out.println("##############################");
System.out.print(p1 + " x " + p2 + " = ");
for (int i = result.length - 1; i >= 0; i--) {
System.out.print(result[i]);
}
System.out.println();
System.out.println("##############################");
}