LeetCode | 21. Merge Two Sorted Lists

最新推荐文章于 2024-09-14 00:15:00 发布

susielau1998

最新推荐文章于 2024-09-14 00:15:00 发布

阅读量91

点赞数

分类专栏：坚持就是胜利文章标签：编程练习 LeetCode 打卡

本文链接：https://blog.csdn.net/susielau1998/article/details/85860739

版权

坚持就是胜利专栏收录该内容

10 篇文章 0 订阅

订阅专栏

Description

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

Example:

Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4

1. 麻花辫

想象手中有两股绳子l1和l2，我们想把他们合为一股，比较有效的方法是手中拽住一个开端p，把它当做新辫子的起始点，再依次从l1、l2两股绳子中挑选适合的node放入linked list。

/**
 * 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;
        } else if (l2 == NULL) {
            return l1;
        }
        
        ListNode* head = NULL;
        if (l1->val < l2->val) {
            head = l1;
            l1 = l1->next;
        } else {
            head = l2;
            l2 = l2->next;
        }
        ListNode* p = head;
        
        while (l1 && l2) {
            if (l1->val < l2->val) {
                p->next = l1;
                l1 = l1->next;
            } else {
                p->next = l2;
                l2 = l2->next;
            }
            p = p->next;
        }
        
        if (l2) {
            p->next = l2;
        } else {
            p->next = l1;
        }
        
        return head;
    }
}