21. Merge Two Sorted Lists

题目链接：https://leetcode.com/problems/merge-two-sorted-lists/

代码

# 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:
        if not l2 :
            return l1
        
        if not l1 :
            return l2 
        new_node=ListNode(0)
        head = new_node
        while l1 and l2:
            if l1.val < l2.val :
                new_node.next = l1
                l1 = l1.next
            else :
                new_node.next = l2
                l2 = l2.next
            new_node=new_node.next
        if l1 == None and l2 != None :
            new_node.next=l2
        if l1 != None and l2 == None :
            new_node.next=l1
        
        return head.next

思路详解

遍历的思维，进行比较，若比较小，给新链表，然后指针继续往前。