/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
if(l1==NULL)
return l2;//l1为空,返回l2;
if(l2==NULL)
return l1;//l2为空,返回l1
ListNode temp_head(0);//定义临时节点temp_head
ListNode *ptr=&temp_head;//指向临时节点
while(l1&&l2)
{
if(l1->val < l2->val)//链表l1中的元素小于l2,插入l1
{
ptr->next=l1;
l1=l1->next;
}
else
{
ptr->next=l2;
l2=l2->next;
}
ptr = ptr->next; //ptr指向新连接的节点
}
ptr->next=l1?l1:l2;
return temp_head.next;
}
};