鏁版嵁缁撴瀯闀挎暣鏁板洓鍒欒繍绠?- 鐧惧害鏂囧簱

void LinkList::addtwo()

//节点多的作为被加数，少的作为加数，实现整数绝对值大的加小的 //默认head0存的整数绝对值比head1大 {

int s=0,m1=head0->data,m2=head1->data;

m1=(head0->pre->data/abs(head0->pre->data)); //head0的符号 m2=(head1->pre->data/abs(head1->pre->data)); //head1的符号 LinkNode *p=head0->pre->pre,*q=head1->pre->pre;

result->data=head0->pre->data; //存结果的节点数和符号 while(q!=head1->pre)

//head0存的整数绝对值比head1大，即head0的节点数大于或等于head1 {

currptr=new LinkNode;

currptr->data=(p->data)*m1+(q->data)*m2+s; //两整数相加 if((m1*m2)>0) //如果符号相同 {

if(abs(currptr->data)-10000>=0) //相加后超过10000，则进位 {

s=currptr->data/10000;

currptr->data=abs(currptr->data)000; }

else //abs(currptr->data)-10000<0，不进位 { s=0;

currptr->data=abs(currptr->data); } }

else if(m1>0&&m2<0) //符号不同，在此相当于实现两个正整数相减 {

9 / 16

s=0;

if(currptr->data<0) //小于0，向前一位借1 {

currptr->data+=10000; s=-1; } }

else if(m1<0&&m2>0) //符号不同，在此相当于实现负整数加上正整数 { s=0;

if(currptr->data>0) //大于0， {

currptr->data=10000-currptr->data; s=1; }

else currptr->data=abs(currptr->data); }

currptr->next=result; //存入链表 currptr->pre=result->pre; result->pre->next=currptr; result->pre=currptr; result=currptr; p=p->pre; q=q->pre; }

//当head0节点数比head1长时，继续建链

10 / 16

while(p!=head0->pre) {

currptr=new LinkNode; currptr->data=p->data*m1+s; s=currptr->data/10000; if((m1*m2)>0) {

if(abs(currptr->data)-10000>=0) {

s=currptr->data/10000;

currptr->data=abs(currptr->data)000; }

else {s=0;currptr->data=abs(currptr->data);} }

else if(m1>0&&m2<0) { s=0;

if(currptr->data<0) {

currptr->data+=10000; s=-1; } }

else if(m1<0&&m2>0) { s=0;

if(currptr->data>0) {

currptr->data=10000-currptr->data; s=1;

11 / 16

}

else currptr->data=abs(currptr->data); }

currptr->data=abs(currptr->data)000; currptr->next=result; currptr->pre=result->pre; result->pre->next=currptr; result->pre=currptr; result=currptr; p=p->pre; }

if(s!=0) //处理相加后，进位问题 {

currptr=new LinkNode; currptr->data=abs(s); currptr->next=result; currptr->pre=result->pre; result->pre->next=currptr; result->pre=currptr; result=currptr;

result->pre->data=m1*(abs(result->pre->data)+1); } }

void LinkList::Display() //显示结果 {

LinkNode *p=result;

int FuHao=result->pre->data/abs(result->pre->data);//结果的符号 while(p->data==0&&p!=result->pre->pre)

12 / 16