合并两个有序的单链表

题目：给定两个有序单链表的头节点head1和head2，请合并两个有序链表，合并后的链表依然有序，并返回合并后链表的头节点

class node:
    def __init__(self,value):
        self.value = value
        self.next = None
        
def merge(head1,head2):
    if head1 == None or head2 == None:
        if head2 == None:
            return head1  
        else:
            return head2
        
    head = head1 if head1.value < head2.value else head2
    
    if head == head1:
        cur1 = head1
        cur2 = head2
    else:
        cur1 = head2
        cur2 = head1
        
    pre = None
    
    while cur1!=None and cur2!=None:
        
        if cur1.value <= cur2.value:
            pre = cur1
            cur1 = cur1.next
            
        else:
            next_ = cur2.next
            pre.next = cur2
            cur2.next = cur1
            pre = cur2
            cur2 = next_
            
    
    if cur2 == None:
        pre.next = cur1
    else:
        pre.next = cur2
    
    return head