思路就是,先将输入的字符串,一个一个的转成数字,逆向存入到数组中,即,输入“1234”,在数组中是[4,3,2,1],然后,一位一位对应相加,用rem保存进位值,最后也有可能产生进位,要注意!!!
import java.util.Scanner;
/**
* Main
*
* @author 小朝
* @date 2020/3/2
*/
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
String n = scanner.next();
String m = scanner.next();
String[] n1 = n.split("");
String[] m1 = m.split("");
int [] a =new int[n1.length];
int [] b = new int[m1.length];
int [] c = new int[100];
for(int i =0;i<n1.length;i++){
// 将字符串逆向存入到数组中
a[i] = Integer.parseInt(n1[n1.length-1-i]);
}
for(int i =0;i<m1.length;i++){
// 将字符串逆向存入到数组中
b[i] = Integer.parseInt(m1[m1.length-1-i]);
}
// 记录进位
int rem = 0;
for(int i=0;i<Math.max(a.length,b.length);i++){
if(i>=a.length){
// 即a已经加完了,直接把b数组给c,但是要考虑进位,下同
c[i] = b[i]+rem;
rem = c[i]/10;
c[i] = c[i]%10;
}
else if(i>=b.length){
c[i] = a[i]+rem;
rem = c[i]/10;
c[i] = c[i]%10;
}else {
c[i] = a[i]+b[i]+rem;
rem = c[i]/10;
c[i] = c[i]%10;
}
}
if(rem>0){
// 到最后如果有进位,则要多输出一位
c[Math.max(a.length,b.length)] = rem;
for(int i = Math.max(a.length,b.length);i>-1;i--){
System.out.print(c[i]);
}
}else {
for(int i = Math.max(a.length,b.length)-1;i>-1;i--){
System.out.print(c[i]);
}
}
}
}