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

合并两个排序的链表

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

#     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:

        head = ListNode(-1)
        dummy = head
        while pHead1 != None and pHead2 != None:
            if pHead1.val < pHead2.val:
                dummy.next = pHead1
                pHead1 = pHead1.next
            else:
                dummy.next = pHead2
                pHead2 = pHead2.next
            dummy = dummy.next
        if pHead1:
            dummy.next = pHead1
        else:
            dummy.next = pHead2
        return head.next
            
全部评论

相关推荐

点赞 评论 收藏
分享
评论
点赞
收藏
分享
牛客网
牛客企业服务