def swap(head):
dummy = ListNode(0)
dummy.next = head
prev, curr = dummy, head
while curr and curr.next:
## save prt
next_ptr = curr.next.next
second = curr.next
## reverse
second.next = curr
curr.next = next_ptr
prev.next = second
## update ptrs
prev = curr
curr = next_ptr
return dummy.next
'leetcode 풀이 > LinkedList' 카테고리의 다른 글
leetcode 21. Merge Two Sorted Lists (0) | 2022.08.28 |
---|---|
leetcode 206. Reverse Linked List (0) | 2022.04.05 |
댓글