竖式计算
1.比较2个数组长度,结果取较长的+1
2.对齐竖式所加位,结果放入结果数组
3.对结果数组进行进位操作
package char3;
public class BigIntAdd {
char[] add(char[] a,char[] b){
if(a.length<=0 || b.length<=0)
return null;
int len = a.length>b.length?a.length:b.length;
char[] c = new char[len+1];
for(int i=0;i<=len;i++)
c[i] = '0';
for(int i=a.length-1,j=c.length-1;i>=0;i--,j--)
c[j] = a[i];
for(int i=b.length-1,j=c.length-1;i>=0;i--,j--)
c[j] = (char)(c[j] + b[i] - '0');
for(int i = c.length-1;i>=1;i--) {
int n = c[i]-'0';
if(n>=10) {
c[i-1] = (char)(c[i-1] + n/10);
c[i] = (char)('0' + n%10);
}
}
return c;
}
void printNumber(char[] number) {
boolean isZero = true;
for(int i=0;i<number.length;i++) {
if(isZero && number[i]!='0') {
isZero = false;
}
if(!isZero) {
System.out.print(number[i]);
}
}
System.out.println();
}
}