java两个字母链表交叉合并,两个链表的交叉合并

#includetypedef struct Node

{

int data;

Node *next;

} node,*linklist;

/*

该函数用来创建链表

*/

linklist creat(linklist head)

{

node *r,*s;

int a;

r = (linklist)malloc(sizeof(node));

head = r;

scanf("%d",&a);

while(a != 0)

{

s =(node*)malloc(sizeof(node));

s->data=a;

r->next=s;

r=s;

printf("please input a data:");

scanf("%d",&a);

}

r->next=NULL;

return head;

}

/*用于实现链表A,B的组合*/

linklist mergel(linklist A,linklist B)

{

node *p,*q,*s,*t;

linklist C;

p=A->next;

q=B->next;

C=A;

while(p&&q)

{

s=p->next;

p->next=q;

if(s)

{

t=q->next;

q->next=s;

}

p=s;

q=t;

}

return C;

}

int main()

{

linklist p,A,B,C;

printf("Creat linklist A:");

A = creat(A);

printf("Creat linklist B:");

B = creat(B);

C = mergel(A,B);

p = C->next;

while(p)

{

printf("%d\n",p->data);

p = p->next;

}

printf("Over\n");

getchar();

getchar();

return 0;

}