[Leetcode] 206. Reverse Linked List

https://leetcode.com/problems/reverse-linked-list

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:
        if head is None:
            return head
        
        nodes = []
        node = head
        while node != None:
            nodes.append(node.val)
            node = node.next

        nodes.reverse()

        head = node = ListNode(nodes[0])
        for n in nodes[1:]:
            node.next = ListNode(n)
            node = node.next

        return head