package test;
import java.util.Scanner;
public class 大整数相加 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.println("input a number:");
String str1 = scan.next();
System.out.println("input a number:");
String str2 = scan.next();
StringBuffer bf1 = new StringBuffer();
StringBuffer bf2 = new StringBuffer();
bf1.append(str1);
bf2.append(str2);
bf1.reverse();
bf2.reverse();
char[] charArray1 = bf1.toString().toCharArray();
char[] charArray2 = bf2.toString().toCharArray();
int lenc1 = charArray1.length;
int lenc2 = charArray2.length;
int lencc = lenc1 > lenc2 ? lenc1 : lenc2;
int[] intArray1 = new int[lencc + 1];
int[] intArray2 = new int[lencc + 1];
// System.out.println();
for (int i = 0; i < lenc1; i++) {
intArray1[i] = charArray1[i] - 48;
// System.out.print(intArray1[i]);
}
System.out.println();
for (int i = 0; i < lenc2; i++) {
intArray2[i] = charArray2[i] - 48;
// System.out.print(intArray2[i]);
}
// int len1=intArray1.length;
// int len2=intArray2.length;
System.out.println();
// int len=len1>len2?len1:len2;
// System.out.println(len);
int[] sum = new int[lencc + 1];
for(int i=0;i<sum.length;i++)
sum[i]=0;
int temp = 0;
for (int i = 0; i < lencc + 1; i++) {
sum[i] = (intArray1[i] + intArray2[i] + temp) % 10;
System.out.print("sum["+i+"]:"+sum[i]);
temp = (intArray1[i] + intArray2[i] + temp) / 10;
System.out.println("\ttemp:"+temp);
}
System.out.println();
for (int i = lencc; i >= 0; i--) {
// if(sum[i]==0 && i>=len-1)
if (sum[lencc] == 0&&i==lencc)
continue;
else
System.out.print(sum[i]);
}
}
}
import java.util.Scanner;
public class 大整数相加 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.println("input a number:");
String str1 = scan.next();
System.out.println("input a number:");
String str2 = scan.next();
StringBuffer bf1 = new StringBuffer();
StringBuffer bf2 = new StringBuffer();
bf1.append(str1);
bf2.append(str2);
bf1.reverse();
bf2.reverse();
char[] charArray1 = bf1.toString().toCharArray();
char[] charArray2 = bf2.toString().toCharArray();
int lenc1 = charArray1.length;
int lenc2 = charArray2.length;
int lencc = lenc1 > lenc2 ? lenc1 : lenc2;
int[] intArray1 = new int[lencc + 1];
int[] intArray2 = new int[lencc + 1];
// System.out.println();
for (int i = 0; i < lenc1; i++) {
intArray1[i] = charArray1[i] - 48;
// System.out.print(intArray1[i]);
}
System.out.println();
for (int i = 0; i < lenc2; i++) {
intArray2[i] = charArray2[i] - 48;
// System.out.print(intArray2[i]);
}
// int len1=intArray1.length;
// int len2=intArray2.length;
System.out.println();
// int len=len1>len2?len1:len2;
// System.out.println(len);
int[] sum = new int[lencc + 1];
for(int i=0;i<sum.length;i++)
sum[i]=0;
int temp = 0;
for (int i = 0; i < lencc + 1; i++) {
sum[i] = (intArray1[i] + intArray2[i] + temp) % 10;
System.out.print("sum["+i+"]:"+sum[i]);
temp = (intArray1[i] + intArray2[i] + temp) / 10;
System.out.println("\ttemp:"+temp);
}
System.out.println();
for (int i = lencc; i >= 0; i--) {
// if(sum[i]==0 && i>=len-1)
if (sum[lencc] == 0&&i==lencc)
continue;
else
System.out.print(sum[i]);
}
}
}