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.
利用一个虚拟头结点来简化代码
class Solution {
public:
ListNode *swapPairs(ListNode *head) {
ListNode* node = new ListNode(-1);
node->next = head;
head = node;
while(node->next!=NULL && node->next->next!=NULL){
ListNode* t1 = node->next;
ListNode* t2 = t1->next;
node->next = t2;
t1->next = t2->next;
t2->next = t1;
node = node->next->next;
}
return head->next;
}
};