合并两个有序的单链表 C语言
一直搞不懂哪里出现问题。这个题目一定要以free(L2) 结尾。 L1作为最后合并的结果。大神们救我
void merge(LL_t *L1, LL_t *L2){
if (L2->head == NULL) {
}
else if (L1->head == NULL) {
*L1 = *L2;
}
else{
node_t* curr2=L2->head;
while(curr1!=NULL || curr2!=NULL){
if(curr1->data < curr2-> data){
curr1=curr1->next;
prev1=prev1->next;
}
else if(curr1->data > curr2-> data)
{
curr2->next=curr1;
prev1->next=curr2;
curr2=curr2->next;
}
}
if(curr1==NULL && curr2!=NULL){
prev1=curr2;
L1->tail=L2->tail;
}
}
free(L2);
}