LintCode 165. Merge Two Sorted Lists

题目

思路

水题

代码

"""
Definition of ListNode
class ListNode(object):
    def __init__(self, val, next=None):
        self.val = val
        self.next = next
"""


class Solution:
    """
    @param: l1: ListNode l1 is the head of the linked list
    @param: l2: ListNode l2 is the head of the linked list
    @return: ListNode head of linked list
    """
    def mergeTwoLists(self, l1, l2):
        # write your code here
        dummy = ListNode(0)
        node = dummy
        while l1 and l2:
            if l1.val <= l2.val:
                node.next = l1
                node = node.next
                l1 = l1.next
            else:
                node.next = l2
                node = node.next
                l2 = l2.next
        while l1:
            node.next = l1
            node = node.next
            l1 = l1.next
        while l2:
            node.next = l2
            node = node.next
            l2 = l2.next
        node.next = None
        return dummy.next