这个题目就是按部就班的做就行了,加一个新的头结点会更加方便操作。while停止的条件要注意。
class Solution {
public ListNode swapPairs(ListNode head) {
ListNode new_head = new ListNode(0,head);
ListNode pre = new_head;
while (pre.next != null && pre.next.next != null){
ListNode temp = head.next.next;
pre.next = head.next;
head.next.next = head;
head.next = temp;
pre = head;
head = head.next;
}
return new_head.next;
}
}