//实现一个大数加法:123456789999+1231231131111
//思路:用两个整形数组从低位开始保存数字结果,int a[1000],b[1000],相加的结果保存在a[i]中
//a[i]=a[i]+b[i]+up, up=a[i]/10, a[i]=a[i]%10
const int Max=1000;
int a[Max], b[Max];
void BiggerPlus(string s1, string s2){
int len1, len2;
len1 = s1.size();
len2 = s2.size();
//初始化
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
//读数据,s1的最后位保存在数组中的开始部分
for (int i = len1 - 1, k = 0; i != -1;--i){
a[k] = s1[i] - '0';
++k;
}
for (int j = len2 - 1, k = 0; j != -1; --j){
b[k] = s2[j] - '0';
++k;
}
//做加法
int up = 0;
for (int i = 0; i < Max; ++i){
a[i] = a[i] + b[i] + up;
up = a[i] / 10;
a[i] = a[i] % 10;
}
//从右向左找到a数组中第一个不为0的数
int k = Max-1;
while (a[k] == 0)
--k;
//从右边第一个不为0的数开始,向左输出数组
for (int i = k; i != -1; --i)
cout << a[i];
return;
}
主要参考:http://www.cnblogs.com/thewaytomakemiracle/p/4996622.html