Given a linked list, swap every two adjacent nodes and return its head.
For example,
Given 1->2->3->4, you should return the list as 2->1->4->3.
For example,
Given 1->2->3->4, you should return the list as 2->1->4->3.
Your algorithm should use only constant space. You may not modify the values in the list, only nodes itself can be changed.
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode swapPairs(ListNode head) {
ListNode preHead=new ListNode(0);
/*定义两交换节点的前驱节点pre与后驱节点post,防止交换过程中导致的节点关系变化*/
ListNode pre=preHead,post;
pre.next=head;
while(head!=null&&head.next!=null)
{
post=head.next.next;
//节点交换
pre.next=head.next;
pre.next.next=head;
//调整交换后的第二个节点的next节点
head.next=post;
pre=head;
head=head.next;
}
return preHead.next;
}
}