21. Merge Two Sorted Lists

706次阅读
没有评论

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

Example:

<b>Input:</b> 1->2->4, 1->3->4
<b>Output:</b> 1->1->2->3->4->4

解法

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def mergeTwoLists(self, l1: 'ListNode', l2: 'ListNode') -> 'ListNode':
        
        newHead = ListNode(None)
        pointer = newHead

        while l1 or l2:            
            if l1 is not None and (l2 is None or l1.val <= l2.val):
                pointer.next = l1
                l1 = l1.next
            else:
                pointer.next = l2
                l2 = l2.next

            pointer = pointer.next

        return newHead.next
            
            
                
            
        
admin
版权声明:本站原创文章,由admin2019-02-11发表,共计421字。
转载提示:除特殊说明外本站文章皆由CC-4.0协议发布,转载请注明出处。
评论(没有评论)