《剑指Offer（第二版）》面试题24. 反转链表

定义一个函数，输入一个链表的头节点，反转该链表并输出反转后链表的头节点。

示例:
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
 
限制：
0 <= 节点个数 <= 5000

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

class Solution:
    # 头插法
    def reverseList(self, head: ListNode) -> ListNode:
        if head==None:
            return head

        old = head.next
        new = head
        new.next = None
        
        while old != None:
            flag = old
            old = old.next
            flag.next = new
            new = flag
        return new