https://leetcode-cn.com/problems/fan-zhuan-lian-biao-lcof/
    点击查看【bilibili】

    1. # Definition for singly-linked list.
    2. # class ListNode(object):
    3. #     def __init__(self, x):
    4. #         self.val = x         # 数据域
    5. #         self.next = None  # 指针域
    7. class Solution(object):
    8.     def reverseList(self, head):
    9.         """
    10.         :type head: ListNode
    11.         :rtype: ListNode
    12.         """
    13.         preNode = None
    14.         curNode = head
    15.         while curNode:
    16.             # 创建临时变量存储cur的下一位
    17.             temp = curNode.next
    18.             # 断开节点
    19.             curNode.next = preNode
    20.             # 处理下一位
    21.             preNode = curNode
    22.             curNode = temp
    23.         return preNode