[leetcode-206] Reverse Linked List

LeetCode-206

Reverse Linked List : Reverse Linked List

note : 연결 리스트 역순으로 정렬

        :::python

# 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]:
        def reverse(node: ListNode, prev: ListNode = None):
            if not node:
                return prev
            next, node.next = node.next, prev
            return reverse(next, node)
        return reverse(head)

Result : 36ms Memory: 20.4mb