Java数组实现高精度加法

import java.util.Scanner;

public class Gaojing {
	public static final int MaxSize = 50;
	private int[] number1;
	private int[] number2;
	public int Max(int top1,int top2){
		return top1 > top2 ? top1 : top2;
	}
	public Gaojing(){
		System.out.println("please input the first number");
		number1 = new int[MaxSize];
		Scanner enter = new Scanner(System.in);
		String Num1 = enter.next();
		int top1 = -1,top2 = -1,i = 0;
		while(i < Num1.length()){
			number1[++top1] = Num1.charAt(Num1.length() - 1 -i) - '0';
			i++;
		}
		i = 0;
		System.out.println("please input the second number");
		String Num2 = enter.next();
		number2 = new int[MaxSize];
		while(i < Num2.length()){
			number2[++top2] = Num2.charAt(Num2.length() - 1 -i) - '0';
			i++;
		}
		i = 0;
		int carry = 0;
		int number3[] = new int[Max(top1,top2) + 2];
		while(i <= Max(top1,top2) + 1){
			number3[i] = (number1[i] + number2[i] + carry) % 10;
			carry = (number1[i] + number2[i] + carry) / 10;;
			i++;
		}
		int i1 = number3.length - 1;
		if(number3[number3.length - 1] == 0  ){
			i1 = number3.length - 2;
		}
		for(;i1 >= 0;i1--){
			System.out.print(number3[i1] + " ");
		}
		enter.close();
	}		
}

主方法创建调用

public class test2 {
    public static void main(String[]args){
        System.out.println();
        new Gaojing();
    }
}

结果展示