Leetcode 21. 合并两个有序链表

最新推荐文章于 2024-09-12 21:19:00 发布

Bendaai

最新推荐文章于 2024-09-12 21:19:00 发布

阅读量114

点赞数

本文链接：https://blog.csdn.net/bendaai/article/details/79986954

版权

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