[리트코드] 206. Reverse Linked List

문제 링크

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

느낀 점

링크드리스트가 어떻게 표현되는지 감을 잡을 수 있는 문제였다.

# 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]:
        node, prev = head, None
        
        while node:
            next, node.next = node.next, prev
            prev, node = node, next
        return prev