LeetCode【21.合并俩个有序链表】
题目描述:
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/merge-two-sorted-lists/description/
思路:
比较俩链表的结点,如果L1<=L2,把链表2在链表1后存放。如果L2>L1,把链表1在链表3后存放,将结果放在链表3中。
代码实现:
/**
* 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, *tail;
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
{
tail->next = l2;
l2 = l2->next;
}
tail = tail->next;
}
if(l1 != NULL)
tail->next = l1;
if(l2 != NULL)
tail->next = l2;
return head;
}
环境:
c语言