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) {
if (head == NULL) return NULL;
if (head->next == NULL) return head;
ListNode *temp = new ListNode(head->val);
temp->next = head->next->next;
ListNode *p = head->next;
head->val = head->next->val;
head->next = temp;
head->next->next = swapPairs(head->next->next);
delete p;
p = NULL;
return head;
}
};