将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
//========================================================
/**
* 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;
else if(l2 == NULL)
return l1;
struct ListNode *head=NULL; //1. 确定合并后的头结点,选择两个链表头节点中值较小的那个
if(l1->val <= l2->val)
{
head = l1;
l1 = l1->next;
}
else// if(l1->val > l2->val)
{
head = l2;
l2 = l2->next;
}
struct ListNode *p = head;
while(l1 && l2) //2. 当两个链表都不为空的时候,合并两个链表
{
if(l1->val <= l2->val)
{
p->next = l1;
l1 = l1->next;
}
else
{
p->next = l2;
l2 = l2->next;
}
p = p->next;
}
if(l1) //3. 处理剩余链表的部分
{
p->next = l1;
}
else if(l2)
{
p->next = l2;
}
return head;
}
//============================================================
/**
* 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 *head=NULL;
if(l1->val <= l2->val)
{
head=l1;
head->next = mergeTwoLists(l1->next, l2);
}
else
{
head=l2;
head->next = mergeTwoLists(l1, l2->next);
}
return head;
}