大数加法

大数加法相比大数乘法来说就相对简单了，仍可以利用手工模拟加法的思想来计算大数加法，大数加法也可以采用先进行加法计算，即第i位的数相加仍保存在第i位，最后再统一处理进位。由于大数加法比较简单就边加边处理进位。

import java.util.Scanner;

public class bigNumberPlus {
    static char[] reverse(char[] ch){//字符反转，即123转为321
        int length = ch.length;
        char[] temp = new char[length];
        for(int i=0;i<length;i++){
            temp[length-1-i] = ch[i];            
        }
        
        
        return temp;
    }
    static void plus(char[] chr1, char[] chr2){
        int length = chr1.length>=chr2.length?chr1.length:chr2.length;
        chr1 = reverse(chr1);
        chr2 = reverse(chr2);
        int [] result = new int [length];
    
        int gobit = 0;
        for(int i=0;i<length;i++){ //如果一个数的位数已遍历完，剩下的位数由0代替
            int a_number = i<chr1.length?(chr1[i]-48):0;
            int b_number = i<chr2.length?(chr2[i]-48):0;
            int temp = gobit + a_number+b_number;
            if(temp>=10){
                result[i] = temp-10;
                gobit = 1;
            }else{
                result[i] = temp;
                gobit = 0;
            }
        }
        if(gobit>0)        //最高位进位的话就输出，没将进位保存在result数组中
            System.out.print(gobit);
        for(int i=length-1;i>=0;i--)
            System.out.print(result[i]);
    }
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner  sc = new Scanner(System.in);
        char [] chr1 = sc.next().toCharArray();
        char [] chr2 = sc.next().toCharArray();
        plus(chr1, chr2);
        
    }

}