java实现大整形加法、减法（还没有乘法和除法，目测除法会很难，乘法还凑合）

额看了很多c++，java实现的大整形，看来看去，还是按照自己的思路来实现吧

虽然实现了，但测试的数据不多，不知道有没有bug，有待完善

效率太低了，整了n个小时，学会debug很好，但是面试时候是手写的，很难保证不出错，多做练习吧，多往纸上写

中间还看了看正则表达式

真心佩服写BinInteger的java大拿啊！！这都能整出来！！！

注释要加上

public class BigInt {
private static String add(String a, String b) {
StringBuilder stringBuilder = new StringBuilder();
StringBuilder reverseA = new StringBuilder(a).reverse();
StringBuilder reverseB = new StringBuilder(b).reverse();
// System.out.println(a);
// System.out.println(b);
// System.out.println(reverseA);
// System.out.println(reverseB);
int length_min;
int length_max;
// 判断是否为数字
if (a.matches("-?\\d+") && b.matches("-?\\d+")) {
// 判断a、b都为正整数的时候

if ((a.charAt(0) != '-') && (b.charAt(0) != '-')) {
int index = 0;
int current = 0;
length_max = (a.length() > b.length()) ? a.length() : b
.length();
for (int i = 0; i < length_max; i++) {
int plus1;
int plus2;
int sum;
if (i < a.length())
plus1 = reverseA.charAt(i) - 48; // asc码转化
else
plus1 = 0;
if (i < b.length())
plus2 = reverseB.charAt(i) - 48; // asc码转化
else
plus2 = 0;
sum = plus1 + plus2 + index;
if (sum >= 10) {
current = sum - 10;
index = 1;
} else {
current = sum;
index = 0;
}
stringBuilder.append(current);
}
if (index != 0)
stringBuilder.append(index);
return new String(stringBuilder.reverse());
}
if ((a.charAt(0) == '-') && (b.charAt(0) != '-')) {
return sub(b,a.substring(1));
}
if ((a.charAt(0) != '-') && (b.charAt(0) == '-')) {
return sub(a,b.substring(1));
}
if ((a.charAt(0) == '-') && (b.charAt(0) == '-')) {
return "-" + add(a.substring(1), b.substring(1));
}
return "出错！";
} else {
return "请输入正确的数字！";
}


}


private static String sub(String a, String b) {
StringBuilder stringBuilder = new StringBuilder();
StringBuilder reverseA = new StringBuilder(a).reverse();
StringBuilder reverseB = new StringBuilder(b).reverse();
// System.out.println(a);
// System.out.println(b);
// System.out.println(reverseA);
// System.out.println(reverseB);
// 判断是否为数字
if (a.matches("-?\\d+") && b.matches("-?\\d+")) {
// 判断a、b都为正整数的时候
if ((a.charAt(0) != '-') && (b.charAt(0) != '-')) {
int current = 0;
int index = 0;

//根据两字符串的情况，分三种情况，不知道有没有更好的
if (a.length() > b.length()) {
for (int i = 0; i < a.length(); i++) {
int current_a;
int current_b;
int sub;
current_a = reverseA.charAt(i) - 48 - index;
if (i < b.length())
current_b = reverseB.charAt(i) - 48;
else
current_b = 0;
if (current_a >= current_b) {
sub = current_a - current_b;
index = 0;
} else {
sub = 10 + current_a - current_b;
index = 1;
}
stringBuilder.append(sub);
}
return new String(stringBuilder.reverse());
}
if (a.length() < b.length()) {
return "-" + sub(b, a);
}
if (a.length() == b.length()) {     //在这个地方好了很久，不知道该怎么递归，写的有点重复啊
int i;
int j;
for (i = 0; i < a.length(); i++) {
if (a.charAt(i) > b.charAt(i)) {
int current_a;
int current_b;
int sub;
for (j = 0; j < a.length()-i; j++) {
current_a = reverseA.charAt(j) - 48-index;
                                current_b = reverseB.charAt(j) - 48;
if (current_a >= current_b) {
sub = current_a - current_b;
index = 0;
} else {
sub = 10 + current_a - current_b;
index = 1;
}
stringBuilder.append(sub);
}
return new String(stringBuilder.reverse());
}
if(a.charAt(i)<b.charAt(i))
{
return "-"+sub(b.substring(i),a.substring(i));
}
}
return "0";
}


}
if ((a.charAt(0) == '-') && (b.charAt(0) != '-')) {
return add(a, "-" + b);
}
if ((a.charAt(0) != '-') && (b.charAt(0) == '-')) {
return add(a, b.substring(1));
}
if ((a.charAt(0) == '-') && (b.charAt(0) == '-')) {
return sub(b.substring(1), a.substring(1));
}
return "出错！";
} else {
return "请输入正确的数字！";
}


}
 //用于去除字符串开头多余的0
private static String escape_zero(String a)
{
int i;
int start=(a.charAt(0)=='-')?1:0;
for(i=start;i<a.length()-1;i++)
{
if(a.charAt(i)!='0')
break;
}
   return (a.charAt(0)=='-'?"-":"")+a.substring(i);

}


public static void main(String[] args) {
String sum=add("-9999119", "-1231231");
String substraction =escape_zero(sub("20001", "-12345"));
System.out.println(sum);
System.out.println(substraction);


}
}