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
.
Your algorithm should use only constant space. You may not modify the values in the list, only nodes itself can be changed.
Update 14/01/2014:
/**
* Definition for singly-linked list.
* public 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 newhead = new ListNode(-1);
newhead.next = head;
ListNode pre = newhead;
ListNode cur = head;
while(cur!=null && cur.next!=null) {
pre.next = cur.next;
cur.next = pre.next.next;
pre.next.next = cur;
pre = cur;
cur = cur.next;
}
return newhead.next;
}
}
/**
* Definition for singly-linked list.
* public 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 newhead = new ListNode(-1);
newhead.next = head;
ListNode pre = newhead;
ListNode cur = head;
ListNode nex = head.next;
while(nex != null) {
pre.next = nex;
cur.next = nex.next;
nex.next = cur;
pre = cur;
cur = cur.next;
if(cur == null) {
break;
}
nex = cur.next;
}
return newhead.next;
}
}