数据结构题典010：有序单链表的交集（ANSI C）

/*
* Intersection of two non-descending linked lists.
*
* fduan, Dec. 28, 2011.
*/
void intersection( link_list lst_a, link_list lst_b, link_list * lst_i )
{
node_ptr pa = lst_a->next, pb = lst_b->next, s = NULL, p = NULL;
int e1, e2;

init_llist( lst_i );
p = *lst_i;

while( pa != NULL && pb != NULL )
{
if( pa->data < pb->data )
pa = pa->next;
else if( pa->data > pb->data )
pb = pb->next;
else
{
s = ( node_ptr )malloc( sizeof( node ) );
s->data = pa->data;
s->next = NULL;
p->next = s;
p = s;

e1 = pa->data;
e2 = pb->data;

pa = pa->next;
pb = pb->next;

while( pa != NULL && pa->data == e1 )
pa = pa->next;

while( pb != NULL && pb->data == e2 )
pb = pb->next;
}
}
}