/**
* 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) {
if (!head)
return NULL;
ListNode *addHead = new ListNode(-1);
addHead->next = head;
ListNode *first = head, *second = head->next,*preSwap = addHead;
while (second)
{
preSwap->next = second;
first->next = second->next;
second->next = first;
preSwap = first;
first = first->next;
if (!first)
break;
second = first->next;
}
return addHead->next;
}
};
* 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) {
if (!head)
return NULL;
ListNode *addHead = new ListNode(-1);
addHead->next = head;
ListNode *first = head, *second = head->next,*preSwap = addHead;
while (second)
{
preSwap->next = second;
first->next = second->next;
second->next = first;
preSwap = first;
first = first->next;
if (!first)
break;
second = first->next;
}
return addHead->next;
}
};