已知两个链表head1 和head2 各自有序,请把它们合并成一个链表依然有序(可以用递归的方式)
#include <string.h>
struct Node
{
int data;
Node *next;
};
Node *MergeRecursive(Node *head1, Node *head2)
{
Node *head = NULL;
if (head1 == NULL)
{
return head2;
}
if (head2 == NULL)
{
return head1;
}
if (head1->data < head2->data)
{
head = head1 ;
head->next = MergeRecursive(head1->next,head2);
}
else
{
head = head2 ;
head->next = MergeRecursive(head1,head2->next);
}
return head ;
}