題目描述

輸入兩個單調遞增的連結串列，輸出兩個連結串列合成後的連結串列，當然我們需要合成後的連結串列滿足單調不減規則。

時間限制：1秒；空間限制：32768K；本題知識點：連結串列

解題思路

# -*- coding:utf-8 -*-
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class Solution:
    # 返回合併後列表
    def Merge(self, pHead1, pHead2):
        # write code here
        p = ListNode(1)
        new = p
        while pHead1!=None and pHead2!=None:
            if pHead1.val < pHead2.val:
                p.next = pHead1
                pHead1 = pHead1.next
            else:
                p.next = pHead2
                pHead2 = pHead2.next
            p = p.next   #記得更新p
        if pHead1!=None: #注意不要寫成while
            p.next = pHead1
        if pHead2!=None:
            p.next = pHead2
        return new.next