/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2)
{
struct ListNode *head ;
struct ListNode *tail ;
if(l1 == NULL)
{
return l2;
}else if(l2 == NULL)
{
return l1;
}
else
{
if(l1->val <= l2->val)
{
head = l1;
l1 = l1->next;
}
else
{
head = l2;
l2 = l2->next;
}
}
tail = head;
while(l1 != NULL && l2 != NULL)
{
if(l1->val < l2->val)
{
tail->next = l1;
l1 = l1->next;
}
else if(l1->val > l2->val)
{
tail->next = l2;
l2 = l2->next;
}
else if(l1->val == l2->val)
{
tail->next = l1;
l1 = l1->next;
tail = tail->next;
tail->next = l2;
l2 = l2->next;
}
if(tail != NULL)
{
tail = tail->next;
}
}
if(l1||l2)
tail->next=l1!=NULL?l1:l2;
return head;
}