# 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 head
index=head
end=ListNode(index.val)
while(index.next):
index=index.next
cur=ListNode(index.val)
cur.next=end
end=cur
return end