Question

数据结构实验关于长整数求长的问题，不知自己错在哪

# include <iostream>
using namespace std;
# include <stdlib.h>
# include <conio.h>
# include <stdio.h>
# include <malloc.h>
#include <stdio.h>
#include <math.h>
# define ElemType int
typedef struct LNode
{
ElemType data,carryin;
struct LNode *next,*prior;

} *Link;
typedef struct
{
Link head;
Link tail;
}list;

void Initlist(list &L)
{
struct LNode *p;
if((p=( LNode *)malloc(sizeof(LNode)))==NULL) exit(0);
L.head=L.tail=p;

}

void Creatlist(list &L)
{char a;Link t;
Initlist(L); struct LNode *k;
if((k=( LNode *)malloc(sizeof(LNode)))==NULL) exit(0);
cin>>k->data;cin>>a;
if(k->data>0)
{L.head=L.tail=k;L.tail->next=NULL;

while(1)
{struct LNode *q;
if((q=( LNode *)malloc(sizeof(LNode)))=NULL) exit(0);
cin>>q->data;
a=getchar();
if(a==';'||q->data>9999||q->data<0) exit(0);
q->prior=L.tail;
L.tail->next=q;
L.tail=q;L.tail->next=NULL;q->next=NULL;q=q->next;
};}

else {
k->data=-1;L.head=L.tail=k;L.tail->next=NULL;
if((t=( LNode *)malloc(sizeof(LNode)))=NULL) exit(0);
if( (a=getchar())==',') cin>>t->data;
L.tail->next=t;t->prior=L.head;L.tail=t;L.tail->next=NULL;
do{
if((t=( LNode *)malloc(sizeof(LNode)))=NULL) exit(0);
cin>>t->data;
t->prior=L.tail;
L.tail->next=t;
L.tail=t;L.tail->next=NULL;
}while(t->data=',');
}
}
void displaylist(list l)
{
Link p;
p=l.head;if(p->data!=-1)
cout<<p->data;
else cout<<(-1)*p->data;
p=p->next;
while(p->data||p->next!=NULL)//
{cout<<','<<(p->data);p=p->next;}
}
void main()
{
cout<<"please enter the number ended with ';' "<<endl;
list L;
Creatlist(L);
displaylist(L);
}

Answer 1

帮你修改了一下代码，你的代码太多冗余，容易出错，而且还有= == 不分的情况：
# include <iostream>
using namespace std;
# include <stdlib.h>
# include <conio.h>
# include <stdio.h>
# include <malloc.h>
#include <stdio.h>
#include <math.h>
# define ElemType int
typedef struct LNode
{
ElemType data,carryin;
struct LNode *next,*prior;

} *Link;
typedef struct
{
Link head;
Link tail;
}list;

void Initlist(list &L)
{

L.head=L.tail=NULL;

}
void InsertListFromTail(list &L, int data)
{
struct LNode *p;

if((p=( LNode *)malloc(sizeof(LNode)))==NULL)
exit(0);
memset(p, 0, sizeof(LNode));
p->data = data;

if (L.tail == NULL)
{
L.head = p;
L.tail = p;
}
else
{
L.tail->next = p;
p->prior = L.tail;
L.tail = p;
}

}

void Creatlist(list &L)
{
char a;

Initlist(L);
cin>>a;
if (a == '-')
{
InsertListFromTail(L, -1);
}
else
{
InsertListFromTail(L, a - '0');
}

while(1)
{
a = getchar();
if(a==';')
{
return;
}
InsertListFromTail(L, a - '0');
}

}
void displaylist(list l)
{
Link p;
p=l.head;
if(p->data!=-1)
{
cout<<p->data;
}
else
{
p=p->next;
cout<<(-1)*p->data;
}
p=p->next;
while(p != NULL)//
{cout<<','<<(p->data);p=p->next;}
}
void main()
{
cout<<"please enter the number ended with ';' "<<endl;
list L;
Creatlist(L);
displaylist(L);
}