struct node *merge(struct node *h1,struct node *h2)
{
struct node *p1,*p2,*tail;
p1 = h1->next;
p2 = h2->next;
h1->next = NULL;
tail = h1;
free(h2);
while(p1 != NULL&&p2 != NULL)
{
if(p1->data < p2->data)
{
tail->next = p1;
tail = p1;
p1 = p1->next;
}
else
{
tail->next = p2;
tail = p2;
p2 = p2->next;
}
}
if(p1)
{
tail->next = p1;
}
if(p2)
{
tail->next = p2;
}
return h1;
};
合并两链表
最新推荐文章于 2022-08-14 21:06:44 发布