题解 | #高精度整数加法#

import java.util.*;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {//老八秘制小汉堡
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNext()){
            String s1 = scanner.nextLine();
            String s2 = scanner.nextLine();
            String[] split1 = s1.split("");
            String[] split2 = s2.split("");
            HashMap<Integer, Integer> hm = new HashMap<>();
            hm.put(0,0);
            ArrayList<Integer> sgroup = new ArrayList<>();
            int a= split1.length-1;
            int b= split2.length-1;
            int o = Math.max(a, b) - Math.min(a, b);//少的补位0
            if (a<b){
                for (int i = 0; i <o; i++) {
                    s1="0"+s1;
                }
            }
            if (a>b){
                for (int i = 0; i <o; i++) {
                    s2="0"+s2;
                }
            }
//            System.out.println(s1);
//            System.out.println(s2);
            String[] split3 = s1.split("");
            String[] split4 = s2.split("");
            int c= split3.length-1;
            int d= split4.length-1;
            for (int i = c; i >=0; i--) {
                for (int j = d; j <=d ; j++) {
                    Integer integer1 = Integer.valueOf(split3[i]);
                    Integer integer2 = Integer.valueOf(split4[j]);
                    if (hm.get(0)+integer1+integer2>=10){
                        sgroup.add(hm.get(0)+integer1+integer2-10);
                        hm.put(0,1);
                    }else {
                        sgroup.add(hm.get(0)+integer1+integer2);
                        hm.put(0,0);
                    }
                    d--;
                }
            }
            if (hm.get(0)==1) {
                sgroup.add(hm.get(0));
            }
            String success="";
            for (int i = sgroup.size()-1; i >=0; i--) {
                success=success+sgroup.get(i);
            }
            System.out.println(success);

        }
    }
}