将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/merge-two-sorted-lists
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2){
if(l1 == NULL)
return l2;
if(l2 == NULL)
return l1;
struct ListNode* newl = NULL;
struct ListNode* cut = NULL;
while(l1 && l2)
{
if(l1->val < l2->val)
{
if(cut == NULL)
{
cut = newl = l1;
}
else
{
cut->next = l1;
cut = l1;
}
l1 = l1->next;
}
else
{
if(cut == NULL)
{
cut = newl = l2;
}
else
{
cut->next = l2;
cut = l2;
}
l2 = l2->next;
}
}
if(l1)
{
cut -> next = l1;
}
else
{
cut -> next = l2;
}
return newl;
}