翻转链表

# 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 not head:
            return None
        dummy = None 
        cur, tmp = head, head  
        while cur :
            tmp = cur.next 
            cur.next = dummy 
            cur, dummy = tmp, cur 
        return dummy

https://leetcode-cn.com/problems/fan-zhuan-lian-biao-lcof/