题解 | #反转链表#

# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param head ListNode类 
# @return ListNode类
#
class Solution:
    def ReverseList(self , head: ListNode) -> ListNode:
        # write code here
        if not head:
            return head
        l=[]
        cur=head
        while cur.next:
            l.append(cur.val)
            cur=cur.next
        l.append(cur.val)
        res=cur=ListNode(0)
        for i in range(len(l)-1,-1,-1):
            cur.next=ListNode(l[i])
            cur=cur.next
        return res.next