反转单向和双向链表

【题目】 分别实现反转单向链表和反转双向链表的函数

【要求】 如果链表长度为N,时间复杂度要求为O(N),额外空间 复杂度要求为O(1)

def reverseList(head):
    
    if head == None:
        return
    
    pre = None
    while head!=None:
        next_ = head.next
        head.next = pre
        pre = head
        head = next_
        
    return pre
  
def reverseDoubleList(head):
    if head == None:
        return
    
    pre = None
    
    while head!=None:
        next_ = head.next
        head.next = pre
        head.pre = next_
        pre = head
        head = next_
        
    return pre