题目
**
方法一
**
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* mergeTwoLists(struct ListNode* list1, struct ListNode* list2){
struct ListNode* list3,*p;
list3 = (struct ListNode *)malloc(sizeof(struct ListNode));
list3->next = NULL;
if(list1==NULL)
return list2;
if(list2==NULL)
return list1;
if(list1->val<=list2->val)
{
list3->val = list1->val;
list1 = list1->next;
}
else
{
list3->val = list2->val;
list2 = list2->next;
}
p = list3;
while(list1&&list2)
{
if(list1->val<=list2->val)
{
p->next = list1;
p = p->next;
list1 = list1->next;
}
else
{
p->next = list2;
p = p->next;
list2 = list2->next;
}
}
if(list1)
p->next = list1;
if(list2)
p->next = list2;
return list3;
}
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2){
if(l1==NULL)
return l2;
if(l2==NULL)
return l1;
if(l1->val < l2->val){
l1->next = mergeTwoLists(l1->next,l2);
return l1;
}else{
l2->next = mergeTwoLists(l1,l2->next);
return l2;
}