题解 | #合并两个排序的链表#

合并两个排序的链表

https://www.nowcoder.com/practice/d8b6b4358f774294a89de2a6ac4d9337

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: ListNode, pHead2: ListNode) -> ListNode:
        pHead4 = pHead3 = ListNode(0) while pHead1 and pHead2: if pHead1.val <= pHead2.val:
                  pHead3.next = pHead1
                  pHead1 = pHead1.next else:
                  pHead3.next= pHead2
                  pHead2 = pHead2.next
              pHead3 = pHead3.next
        pHead3.next = pHead1 or pHead2 return pHead4.next
l1 = ListNode(2)
l1.next = ListNode(5)
l1.next.next = ListNode(8)
l2 = ListNode(3)
l2.next = ListNode(9)
l2.next.next = ListNode(10)
solution = Solution()
pre = solution.Merge(l1,l2) while pre: print(pre.val, end=',')
    pre = pre.next
#Python面经#
全部评论

相关推荐

点赞 评论 收藏
分享
11-14 16:13
已编辑
重庆科技大学 测试工程师
Amazarashi66:不进帖子我都知道🐮❤️网什么含金量
点赞 评论 收藏
分享
评论
点赞
收藏
分享
牛客网
牛客企业服务