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.
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *swapPairs(ListNode *head) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (!head)
return NULL;
if (head->next == NULL)
return head;
ListNode *pPre = NULL;
ListNode *pCur = head;
ListNode *pNext = NULL;
while (pCur && pCur->next)
{
if (pPre)
pPre->next = pCur->next;
else
head = pCur->next;
pPre = pCur;
pNext = pCur->next->next;
pCur->next->next = pCur;
pCur = pNext;
pPre->next = pCur;
}
return head;
}
};