Question

用数据结构算法实现----任意长的整数相加

设计一个程序实现两个任意长的整数的求和运算。
基本要求：利用双向循环链表，设计一个实现任意长的整数进行加法运算的演示程序。要求输入和输出每四位一组，组间用逗号隔开。如：1，0000，0000，0000，0000。
最好用C++实现

Answer 1

大体上是这样的，但是不太完善，输入的第一个数的组数（可以说就是逗号个数）要大于等于第二个数，测了测只要输入正确的话应该没什么问题
没时间完善了，lz根据情况自己改改吧
ps：不能计算负数

//created by onceway
#include<stdio.h>
#include<stdlib.h>
#include<memory.h>

#define MAXLEN 100

typedef struct _num_array{
int num;
int carry;
struct _num_array *prev;
struct _num_array *next;
} Numarray;

Numarray *create(char *num)
{
Numarray *hnum ,*newnode;
char *p;
p = strtok(num, ",");
if (NULL == p)
return NULL;
hnum = (Numarray *)malloc(sizeof(Numarray));
memset(hnum, 0, sizeof(Numarray));
hnum->num = atoi(p);
hnum->next = hnum;
hnum->prev = hnum;
newnode = hnum;
while((p = strtok(NULL, ",")) != NULL) {
newnode->next = (Numarray *)malloc(sizeof(Numarray));
memset(newnode->next, 0, sizeof(Numarray));
newnode->next->num = atoi(p);
newnode->next->prev = newnode;
newnode = newnode->next;
}
newnode->next = hnum;
hnum->prev = newnode;
return hnum;
}

void release(Numarray *hnum)
{
Numarray *p = hnum;
while(p->next != hnum) {
p=p->next;
free(p->prev);
}
free(p);
}

void calc(Numarray *hnum1, Numarray *hnum2)
{
Numarray *p1, *p2;
p1 = hnum1->prev;
p2 = hnum2->prev;
if(NULL == hnum1 || NULL == hnum2)
return;
do {
p1->num = p1->num + p2->num + p1->next->carry;
if(p1->num > 9999) {
p1->num -= 10000;
p1->carry = 1;
}
p1 = p1->prev;
p2 = p2->prev;
} while(p1 != hnum1->prev && p2 != hnum2->prev);
if(p2 == hnum2->prev && p1 != hnum1->prev)
p1->num += p1->next->carry;
}

int main()
{
char num1[MAXLEN];
char num2[MAXLEN];
Numarray *hnum1, *hnum2;
Numarray *t1, *t2;
printf("Input 2 number as form (1,0000,1000,1234) : \n");
gets(num1);
gets(num2);
hnum1 = create(num1);
hnum2 = create(num2);
t1 = hnum1;
t2 = hnum2;
do {
printf("%04d,", t1->num);
t1 = t1->next;
}while(t1 != hnum1);
printf(" + ");
do {
printf("%04d,", t2->num);
t2 = t2->next;
}while(t2 != hnum2);
printf(" =\n");
calc(hnum1, hnum2);
do {
printf("%04d,", t1->num);
t1 = t1->next;
}while(t1 != hnum1);
printf("\n");
release(hnum1);
release(hnum2);
}

Answer 2

下个大数库，什么语言都有的。
你百度搜 大数 运算库

Answer 3

用字符串表示长整数，然后取出每一位来转换为整数，按照列竖式手算加减法的方法从后到前计算

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX_BIT 1000
void add(char *re,char *op1,char *op2)
{
int i=0,cf=0,temp,m1,m2;
while(1)
{
if(*op1)m1=*op1-48,++op1;
else m1=0;
if(*op2)m2=*op2-48,++op2;
else m2=0;
temp=m1+m2+cf;
cf=temp/10;
re[i++]=temp%10+48;
if(!*op1&&!*op2)
{
if(cf)re[i++]=cf+48;
re[i]=0;
break;
}
}
}
void make(char *op1,char *op2)
{
char re[MAX_BIT];
int i=0;
add(re,strrev(op1),strrev(op2));
strrev(re);
while(*(re+i)=='0')i++;
printf("%s\n",re+i);
}
int main()
{
char op1[MAX_BIT],op2[MAX_BIT];
scanf("%s%s",op1,op2);
make(op1,op2);
system("PAUSE");
return 0;
}

大数运算的，
http://community.csdn.net/Expert/topic/4672/4672903.xml?temp=.3281671

楼主看看吧