JZ25 合并两个排序的链表（链表）

1 题目：

2 参考：

        合并两个排序的链表_牛客题霸_牛客网 (nowcoder.com)

3 代码：

C++

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 *	ListNode(int x) : val(x), next(nullptr) {}
 * };
 */
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param pHead1 ListNode类 
     * @param pHead2 ListNode类 
     * @return ListNode类
     */
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2) {
        // write code here
        if (pHead1 == nullptr) 
            return pHead2;
        if (pHead2 == nullptr) 
            return pHead1; 

        auto head = new ListNode(0);
        ListNode* cur = head;

        while (pHead1 && pHead2) {
            if (pHead1->val <= pHead2->val) {
                cur->next = pHead1;
                pHead1 = pHead1->next; 
            } else {
                cur->next = pHead2;
                pHead2 = pHead2->next; 
            }
            
            cur = cur->next;

            //哪个链表还有剩，直接连在后面
            if (pHead1)
                cur->next = pHead1; 
            else
                cur->next = pHead2; 

        }
        return head->next;
    }
};

Python3

# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param pHead1 ListNode类 
# @param pHead2 ListNode类 
# @return ListNode类
#
class Solution:
    def Merge(self , pHead1, pHead2):
        if pHead1 == None:
            return pHead2
        if pHead2 == None:
            return pHead1

        head = ListNode(0)
        cur = head

        while pHead1 and pHead2:
            if pHead1.val <= pHead2.val:
                cur.next = pHead1
                pHead1 = pHead1.next
            else:
                cur.next = pHead2
                pHead2 = pHead2.next

            cur = cur.next

            if pHead1:
                cur.next = pHead1
            else:
                cur.next = pHead2

        return head.next