ended3월 20일· 7 sources
Reverse a Linked List
연결 리스트 뒤집기
Why it matters
This task demonstrates reversing a singly linked list in-place using an iterative approach with three pointers (prev, curr, next_node). The algorithm traverses the list once, flipping each node's link direction, achieving O(n) time and O(1) space complexity.
7
Sources
+0
24h
—
Growth
185d
Active
array reversaldummy nodeduplicatesin-placein-place reversalin-place swapiterative approachiterative reversaljavaleetcodelinked listlistnodemerge sortpointer manipulationpythonreverselistsorted listthree pointerstwo pointers반복적 역순분할 정복시간 복잡도재귀포인터 조작