【剑指Offer】14合并两个排序的链表

题目描述

输入两个单调递增的链表，输出两个链表合成后的链表，当然我们需要合成后的链表满足单调不减规则。

时间限制：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