思路:当两个整数已经超过了long类型长度的数据。一般的加减乘除运算已经不能用了,因为字符串没有长度限制,所以我们可以用String类型的变量来储存这两个超长的正整数,我们计算加法的时候,一般是从个位开始,所以我们可以先把字符串逆置,然后将字符串转换为char类型的数组,这样char[0]就是个位,char[1]是十位,char[2]是百位…然后将两个正整数的char数组按相同的下标相加,超过十的向下一位进一
package other;
import java.util.Arrays;
public class LongAdd {
public static String add(String str1, String str2){
if(str1 == null || "".equals(str1) || str2 == null || "".equals(str2)){
return "";
}
char[] var1= str1.toCharArray();
reverseStr(var1);
char[] var2= str2.toCharArray();
reverseStr(var2);
int var1Len = var1.length;
int var2Len = var2.length;
int minLen = var1Len > var2Len ? var2Len : var1Len;
int maxLen = var1Len >var2Len ? var1Len : var2Len;
char[] sumStr = new char[maxLen + 1];
int flag = 0;
for(int index = 0 ; index < minLen; index ++){
char elem1 = var1[index];
char elem2 = var2[index];
int elem1Int = Integer.parseInt(String.valueOf(elem1));
int elem2Int = Integer.parseInt(String.valueOf(elem2));
int sum = elem1Int + elem2Int + flag;
if(sum < 10){
flag = 0;
sumStr[index] = String.valueOf(sum).toCharArray()[0];
continue;
}
sumStr[index] = String.valueOf(sum % 10).toCharArray()[0];
flag = 1;
}
char[] max_char = var1.length == maxLen ? var1 : var2;
for(int index = minLen ; index < maxLen; index++ ){
int sum = Integer.parseInt(String.valueOf(max_char[index])) + flag;
if(sum < 10){
flag = 0;
sumStr[index] = sumStr[index] = String.valueOf(sum).toCharArray()[0];
continue;
}
sumStr[index] = String.valueOf(sum % 10).toCharArray()[0];
flag = 1;
}
if(flag > 0){
sumStr[sumStr.length -1] = '1';
}else{
sumStr = subStr(sumStr, 0, sumStr.length - 1);
}
if(sumStr.length <= 0){
return "";
}
reverseStr(sumStr);
return String.valueOf(sumStr);
}
private static void reverseStr(char[] var1){
if(var1 == null || var1.length <= 0){
return;
}
int middle = var1.length / 2;
int maxIndex = var1.length - 1;
for(int index = 0; index <= middle; index ++){
int reverseIndex = maxIndex - index;
if(reverseIndex <= index){
continue;
}
char temp = var1[reverseIndex];
var1[reverseIndex] = var1[index];
var1[index] = temp;
}
}
private static char[] subStr(char[] var, int start, int end){
char[] temp = new char[end - start];
for(int index = start;index < end; index++){
temp[index] = var[index];
}
return temp;
}
}
测试
import other.LongAdd;
public class test {
public static void main(String[] args) {
String result = LongAdd.add("123", "123");
System.out.println("123+123=" + result);
result = LongAdd.add("0", "0");
System.out.println("0+0=" + result);
result = LongAdd.add("12555", "25");
System.out.println("12555+25=" + result);
result = LongAdd.add("999", "999");
System.out.println("999+999=" + result);
result = LongAdd.add("1000", "1000");
System.out.println("1000+1000=" + result);
result = LongAdd.add("999", "1");
System.out.println("999+1=" + result);
}
}
效果截图



