Given a linked list, swap every two adjacent nodes and return its head.
/**
* 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)
{
ListNode *temp=new ListNode(0);
temp->next=head;
ListNode *prev=temp;
ListNode *cur=head;
while(cur&&cur->next)
{
prev->next=cur->next;
cur->next=cur->next->next;
prev->next->next=cur;
prev=cur;
cur=cur->next;
}
return temp->next;
}
};