剑指offer-python 25 合并两个排序的链表

最新推荐文章于 2024-06-23 21:53:45 发布

ys1305

最新推荐文章于 2024-06-23 21:53:45 发布

阅读量169

点赞数

分类专栏：剑指offer 算法

本文链接：https://blog.csdn.net/ys1305/article/details/96110456

版权

剑指offer 同时被 2 个专栏收录

55 篇文章 0 订阅

订阅专栏

算法

55 篇文章 0 订阅

订阅专栏

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

递归

class Solution:
    # 返回合并后列表
    def Merge(self, pHead1, pHead2):
        # write code here
        if pHead1 == None:
            return pHead2
        if pHead2 == None:
            return pHead1
        if pHead1.val < pHead2.val:
            pHead1.next = self.Merge(pHead1.next, pHead2)
            return pHead1
        else:
            pHead2.next = self.Merge(pHead1, pHead2.next)
            return pHead2

迭代

class Solution:
    # 返回合并后列表
    def Merge(self, pHead1, pHead2):
        # write code here
        dummy = ListNode(0)
        dummy2 = dummy
        while pHead1!=None and pHead2!=None:
            if pHead1.val<=pHead2.val:
                dummy.next = pHead1
                pHead1 = pHead1.next
                dummy = dummy.next
            else:
                dummy.next = pHead2
                pHead2 = pHead2.next
                dummy = dummy.next
        if pHead1!=None:
            dummy.next = pHead1
        if pHead2!=None:
            dummy.next = pHead2
        return dummy2.next