代码参考自https://blog.csdn.net/sushauai/article/details/51212314,修复了其中几个bug,修复之处在代码注释之中有注明。
import java.util.Arrays;
/**
由于没有限定输入两个数的大小范围,我们也要把它当做大数问题来处理
思路:
s1:用两个字符数组分别来保存两个数
case1:两个数一正一负
s2:如果是number1为正,number2为负
s3:比较两个数绝对值的大小,并把较大的当做number1
s4:符号和绝对值大者相同,这里可用flag,true表示‘+’(省略),false表示‘-’
s5:新建一个存储结果的字符数组,长度就是number1.length(一正一负不产生溢出),然后使用从后往前遍历的思想,设置借位标志
case2:两个数都为正或都为负
s6:判断一下为负还是为正,设定flag的值
s7:比较两个数绝对值的大小,并把较大的当做number1
s8:新建一个存储结果的字符数组,长度就是number1.length+1(都为正时,设置溢出标志),然后使用从后往前遍历的思想,设置进位标志
s9:最后判断flag和溢出标志,单独处理
*/
public class MS17BigDataAdd {
public static char[] BigIntegerAdd(String number1, String number2){
//两个大整数加法有两种情况:1 一正一负;2 都为正或都为负
//case1:先求两个数绝对值,然后相减,符号与绝对值大者一致
//case2:若是正,直接相加;若为负,绝对值相加,然后再在前面加'-'
//先对输入的数进行处理,将其放在字符数组里
char[] num1 = number1.toCharArray();
char[] num2 = number2.toCharArray();
char[] result=null;
int length=0;//存储结果的数组长度
boolean isOverflow = false;
int iTakeOver = 0;
int iSum = 0;
boolean flag = true;
//case1
if ((num1[0] == '-' && num2[0] !='-') || (num1[0] !='-' && num2[0] =='-')){
if (num1[0] == '-' && num2[0] !='-'){
num1 = absNum(num1);
num2 = absNum(num2);
if (getMaxAbs(num2,num1)){//num2>num1,结果为正
char[] temp=num1;
num1 = num2;
num2 = temp;
}
else {
flag = false;//num1>num2,结果为负
}
}
else {
num1 = absNum(num1);
num2 = absNum(num2);
if (getMaxAbs(num2,num1)){//num2>num1,结果为负
flag = false;
char[] temp=num1;
num1 = num2;
num2 = temp;
}
}
result = new char[num1.length];
for (int i=num1.length-1,j=num2.length-1;i>=0;i--,j--){
if (j>=0){
iSum = (num1[i] -'0') - (num2[j] - '0') + iTakeOver;
if (iSum < 0){
//相减结果小于0,向上借一位
iTakeOver = -1;
iSum = iSum + 10;
result[i] = (char)('0'+iSum);
}
else {
iTakeOver = 0;
result[i] = (char)('0'+iSum);
}
}
else {
iSum = num1[i] - '0' + iTakeOver;
if (iSum < 0){
//相减结果小于0,向上借一位
iTakeOver = -1;
iSum = iSum + 10;
result[i] = (char)('0'+iSum);
}
else {
iTakeOver = 0;
result[i] = (char)('0'+iSum);
}
}
}
}
//case2
else {
if (num1[0] == '-' && num2[0]=='-'){
num1 = absNum(num1);
num2 = absNum(num2);
flag = false;//'-'
}
if (getMaxAbs(num2, num1)){
char[] temp = num1;
num1 = num2;
num2 = temp;
}
result = new char[num1.length];
for (int i=num1.length-1,j=num2.length-1;i>=0;i--,j--){
if (j>=0){
iSum = (num1[i] -'0') + (num2[j] - '0') + iTakeOver;
if (iSum>=10){
if (i==0){
isOverflow=true;
result[i] = (char)('0' + (iSum-10));//修正原代码处该位置没赋值的情况
}
else {
iTakeOver=1;
iSum -=10;
result[i] = (char)('0' + iSum);
}
}
else {
iTakeOver = 0;
result[i] = (char)('0'+iSum);
}
}//end j>=0
else {
iSum = num1[i] - '0' + iTakeOver;
if (iSum>=10){
if (i==0){
isOverflow=true;
result[i] = (char)('0' + (iSum-10));//修正原代码处该位置没赋值的情况
}
else {
iTakeOver=1;
iSum -=10;
result[i] = (char)('0' + iSum);
}
}
else {
iTakeOver = 0;
result[i] = (char)('0'+iSum);
}
}
}
}//end case2
if (!flag || isOverflow){//此处相比原代码增加一种结果同时满足这两种条件时的情况
if (!flag && isOverflow){//如果既是负数又是第一位需要进位的,此时重新申请的数组长度应该要比之前计算得到的多两位
char[] temp = new char[result.length+2];
temp[0] = '-';
temp[1] = '1';
for (int i=0;i<result.length;i++){
temp[i+2] = result[i];
}
return temp;
}
else{//只满足其中一种情况的
char[] temp = new char[result.length+1];
if (!flag){
temp[0] = '-';
}
else {
temp[0]='1';
}
for (int i=0;i<result.length;i++){
temp[i+1] = result[i];
}
return temp;
}
}
else {
return result;
}
}
public static boolean getMaxAbs(char[] num1, char[] num2){
num1 = absNum(num1);
num2 = absNum(num2);
if(num1.length < num2.length){
return false;
}
else if(num1.length > num2.length){
return true;
}
else {
for(int i=0;i<num1.length;i++){
if (num1[i] > num2[i]){
return true;
}
else if (num1[i] < num2[i]){
return false;
}
}
return true;
}
}
public static char[] absNum(char[] num){
if (num[0] !='-'){
return num;
}
return Arrays.copyOfRange(num, 1, num.length);
}
public static void main(String[] args) {
String number1 ="-98";
String number2="-99";
System.out.println(BigIntegerAdd(number1,number2));
}
}