思路:
1.反转两个字符串,便于从低位到高位相加和最高位的进位导致和的位数增加;
2.对齐两个字符串,即短字符串的高位用‘0’补齐,便于后面的相加;
3.把两个正整数相加,一位一位的加并加上进位;
4.最高位有进位则补上。
实现
package cn.mryang.tools;
public class BigData {
public static String add(String n1,String n2) {
StringBuffer result = new StringBuffer();
// 反转字符串
n1 = new StringBuffer(n1).reverse().toString();
n2 = new StringBuffer(n2).reverse().toString();
int len1 = n1.length();
int len2 = n2.length();
int maxLen = len1 > len2 ? len1 : len2;
int c = 0;//进位
if (len1 < len2) {
for (int i = len1; i < len2; i++) {
n1 += "0";
}
} else if (len1 > len2) {
for (int i = len2; i < len1; i++) {
n2 += "0";
}
}
// System.out.println(n1);
// System.out.println(n2);
for (int i = 0; i <maxLen; i++) {
int nSum = Integer.parseInt(n1.charAt(i) +"") + Integer.parseInt(n2.charAt(i) +"")+c;
int ap = nSum%10;
result.append(ap);
c = nSum/10;
}
//最高位进位
if(c>0) {
result.append(c);
}
return result.reverse().toString();
}
}
测试
package cn.mryang.test;
import cn.mryang.tools.BigData;
public class test {
public static void main(String[] args) {
String r= BigData.add("9544545455454545454545543232332442342423424", "9564565465444543535353454354353453");
System.out.println(r);
}
}