题解 | #反转链表#

# -*- coding:utf-8 -*-
class ListNode:
    def __init__(self, x):
        self.val = x
        self.next = None
            
class Solution:
    # 返回ListNode
    def ReverseList(self, pHead):
        # write code here
        if pHead == None or pHead.next == None:
            return pHead
        else:
            nodes = [pHead]
            tmp=pHead.next
            while tmp: 
                nodes.append(tmp)
                tmp = tmp.next
            nodes.reverse()
            for idx, each in enumerate(nodes[:-1]):
                each.next = nodes[idx+1]
            nodes[-1].next = None
            return nodes[0]