该示例程序用于从文件中逐行读入数字相加(一行可能有一个或多个数字),数字的长度不限。
该题考察到的知识点主要是文件读取和数组,在下方的示例程序中我首先将数字字符串转换为单个字符的数组,在转换回int类型时减去的48是字符“0”的ascii码值。当一行数字个数大于2时,我们需要循环使用plus方法。在plus方法中,我定义了一个变量plus来判断进位,先取位数较高的数字长度作为和的长度,在最后判断长度是否超出,若超出,则在最前面添加一位,值为1。
import java.util.*;
import java.io.*;
public class Large_number_sum {
public static void main(String[] args) throws FileNotFoundException{
Scanner input = new Scanner(new File("sum.txt"));
while(input.hasNextLine()) {
String text = input.nextLine();
int n = count_numbers(text);
count_process(text,n);
}
}
// 由于每行数字的个数均不相同,所以分为一个数字,两个数字相加和两个以上数字相加的情况讨论。
public static void count_process(String text,int n) {
Scanner data = new Scanner(text);
if(n == 1){
char[] num = data.next().toCharArray();
for(int i = 0;i < num.length;i++) {
System.out.print(num[i] + " + 0 = " + num[i]);
}
System.out.println();
} else {
char[][] num = new char[n][];
for(int i = 0;i < n;i++){
num[i] = data.next().toCharArray();
}
if(n == 2){
char[] sum = plus(num[0],num[1]);
for(int j = 0;j < num[0].length;j++){
System.out.print(num[0][j]);
}
for(int i = 1;i < num.length;i++){
System.out.print(" + ");
for(int j = 0;j < num[i].length;j++){
System.out.print(num[i][j]);
}
}
System.out.print(" = ");
for(int i = 0;i < sum.length;i++) {
System.out.print(sum[i]);
}
System.out.println();
}
else{
char[] sum = plus(num[0],num[1]);
for(int a = 2; a < n ;a++){
sum = plus(sum,num[a]);
}
for(int j = 0;j < num[0].length;j++){
System.out.print(num[0][j]);
}
for(int i = 1;i < num.length;i++){
System.out.print(" + ");
for(int j = 0;j < num[i].length;j++){
System.out.print(num[i][j]);
}
}
System.out.print(" = ");
for(int i = 0;i < sum.length;i++) {
System.out.print(sum[i]);
}
System.out.println();
}
}
}
public static int count_numbers(String text){
Scanner data = new Scanner(text);
int n = 0;
while(data.hasNext()){
data.next();
n++;
}
return n;
}
// 计算和
public static char[] plus(char[]num1,char[]num2){
int length = Math.max(num1.length,num2.length); // 先取位数较高的数字长度为和的长度
int[] sum = new int[length];
int plus = 0; // plus用于计算进位
for(int i = num1.length-1,j = num2.length-1,k = length-1;k >= 0;i--,j--,k--) {
if (i >= 0 && j >= 0) {
if ((int) num1[i] + (int) num2[j] + plus - 96 < 10) {
sum[k] = (int) num1[i] + (int) num2[j] - 96 + plus;
plus = 0;
} else {
sum[k] = (int) num1[i] + (int) num2[j] - 96 - 10 + plus;
plus = 1;
}
} else if (i < 0 && j >= 0) {
if(plus + (int)num2[j] - 48 >= 10 ){
sum[k] = (int) num2[j] - 48 + plus - 10;
plus = 1;
}else {
sum[k] = (int) num2[j] - 48 + plus;
plus = 0;
}
} else if (i >= 0 && j < 0) {
if(plus + (int)num1[i] - 48 >= 10 ){
sum[k] = (int) num1[i] - 48 + plus - 10;
plus = 1;
}else {
sum[k] = (int) num1[i] - 48 + plus;
plus = 0;
}
}
}
// plus表示进位,如果上述程序结束后plus=1,则需再进一位,即让最高位为1
if(plus == 0){
char[] the_sum = new char[sum.length];
for(int i = 0;i < sum.length;i++){
the_sum[i] = (char)(sum[i]+48);
}
return the_sum;
}else{
char[] the_sum = new char[sum.length + 1];
the_sum[0] = '1';
for(int i = 0;i < sum.length;i++){
the_sum[i+1] = (char)(sum[i]+48);
}
return the_sum;
}
}
}
运行结果如图: