forked from yubinbai/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.java
44 lines (44 loc) · 1.19 KB
/
Solution.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
class ListNode {
int val;
ListNode next;
ListNode(int x) {
val = x;
next = null;
}
}
public class Solution {
public ListNode swapPairs(ListNode head) {
if (head == null || head.next == null) return head;
ListNode prev = head, curr = head.next;
ListNode _prev = null, _curr = null, result = curr;
do {
_prev = curr.next;
if (_prev != null) {
_curr = _prev.next;
} else {
_curr = null;
}
curr.next = prev;
if (_curr == null) {
prev.next = _prev;
} else {
prev.next = _curr;
}
prev = _prev;
curr = _curr;
} while (prev != null && curr != null);
return result;
}
public static void main(String[] args) {
ListNode e = new ListNode(1);
e.next = new ListNode(2);
e.next.next = new ListNode(3);
// e.next.next.next = new ListNode(4);
Solution s = new Solution();
ListNode r = s.swapPairs(e);
while (r != null) {
System.out.println(r.val);
r = r.next;
}
}
}