1
class Solution {
2
public ListNode swapPairs(ListNode head) {
3
ListNode dummy = new ListNode(0), prev = dummy, curr = head;
4
dummy.next = head;
5
while (curr != null && curr.next != null) {
6
prev.next = curr.next;
7
curr.next = curr.next.next;
8
prev.next.next = curr;
9
curr = curr.next;
10
prev = prev.next.next;
11
}
12
return dummy.next;
13
}
14
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0