Node* List::Merge(Node *head1,Node *head2)
{
Node *MergeHead;
if(head1==NULL && head2==NULL)
return NULL;
if(head1==NULL)
return head2;
else if(head2==NULL)
return head1;
if(head1->data<head2->data)
{
MergeHead=head1;
MergeHead->next=Merge(head1->next,head2);
}
else
{
MergeHead=head2;
MergeHead->next=Merge(head1,head2->next);
}
head=MergeHead;
return MergeHead;
}
合并有序单链表
猜你喜欢
转载自blog.csdn.net/Henry313/article/details/88615747
今日推荐
周排行