#include "stdio.h"
#include "malloc.h"
typedef struct ned* pointer;/*定义ned类型*/
struct ned
{
int data;
pointer next;
};
typedef pointer lklist;
lklist initiate_lklist() /*建立空表*/
{
lklist t=(struct ned*)malloc(sizeof(struct ned));
t->next=NULL;
return (t);
}
pointer find_lklist(lklist head,int i) /*查找i*/
{
lklist p=head;
int j=0;
while ((p->next!=NULL)&&(j<i))
{
p=p->next;j++;
}
if(i==j) return(p);
else return (NULL);
}
void insert_lklist(lklist head,int x,int i) /*插入运算*/
{ pointer p=find_lklist(head,i-1);
if(p==NULL)
printf("error\n");
else
{ lklist s=(struct ned*)malloc(sizeof(struct ned));
s->data=x;
s->next=p->next;
p->next=s;
}
}
lklist create_lklist()
{
lklist head=initiate_lklist();
int i=1,x;
scanf("%d",&x);
while(x!=100)
{
insert_lklist(head,x,i);
i++;
scanf("%d",&x);
}
return(head);
}
int main()
{
lklist A,B;
A=create_lklist();
B=create_lklist();
int length(lklist head)
{
int x=0;
while(head->next!=NULL)
{
head->next=p;
p->next=p->next->next;
x++;
}
return (x);
}
int n,m,i;
n=length(A);m=length(B);
A->next=p;B->next=q;
if(n==m)
{
{
for(i=1;i<=n;i++)
{
if(p->next->data==q->next->data)
p->next=p->next->next;q->next=q->next->next; /*继续往后面相等ai=bi*/
}
printf("A=B\n 等于-1");
}
else if(n<=m)
for(i=1;i<n;i++)
{
if(p->next->data==q->next->data)
p->next=p->next->next;q->next=q->next->next;
else if(p->next->data<q->next->data)
{
printf("A<B\n 等于0"); break;
}
}
else printf("A>B\n 等于1");
}
getchar();
}
