荣誉版主
- 积分
- -2403
- 大米
- 颗
- 鳄梨
- 个
- 水井
- 尺
- 蓝莓
- 颗
- 萝卜
- 根
- 小米
- 粒
- 学分
- 个
- 注册时间
- 2010-5-4
- 最后登录
- 1970-1-1
|
Implement Big Integer addition in C
wwwyhx 发表于 2011-7-15 16:01 ![]()
- void reverse(int a[], int n)
- {
- assert(a && n > 0);
- int nBeg = 0;
- int nEnd = n-1;
- while (nBeg < nEnd)
- {
- int nTmp = a[nBeg];
- a[nBeg] = a[nEnd];
- a[nEnd] = nTmp;
- nBeg++, nEnd--;
- }
- }
- int BigNumberAdd(int a[], int m, int b[], int n, int res[])
- {
- assert (a && b && res && m > 0 && n > 0);
- bool bAdd = false;
- int nRes = 0;
- int nA = m-1;
- int nB = n-1;
- while (nB >= 0 || nA >= 0)
- {
- if ((nA >= 0) && (a[nA] < 0 || a[nA] > 9))
- return 0;
- if ((nB >= 0) && (b[nB] < 0 || b[nB] > 9))
- return 0;
- res[nRes] = 0;
- if (nA >= 0) res[nRes] += a[nA--];
- if (nB >= 0) res[nRes] += b[nB--];
- if (bAdd) res[nRes]++;
- if (res[nRes] > 9)
- {
- bAdd = true;
- res[nRes] = res[nRes]%10;
- }
- else bAdd = false;
- nRes++;
- }
- if (bAdd) res[nRes++] = 1;
- reverse(res, nRes);
- return nRes;
- }
复制代码 |
|