写法一:
/**
* 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* h1 = head, *parent = NULL, *h3 = NULL;
while(h1!=NULL && h1->next!=NULL)
{
h3 = h1->next->next;
//swap h1 & h1->next
if(parent == NULL)
head = h1->next;
else
parent->next = h1->next;
h1->next->next = h1;
h1->next = h3;
parent = h1;
h1 = h3;
}
return 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) {
if(NULL == head || NULL == head->next)
return head;
ListNode* h1 = head;
head = head->next;
ListNode* h3 = head->next;
head->next = h1;
h1->next = h3;
ListNode* parent = h1;
h1 = h3;
while(h1!=NULL)
{
if(h1->next == NULL)
break;
h3 = h1->next->next;
//swap h1 & h2
parent->next = h1->next;
h1->next->next = h1;
h1->next = h3;
parent = h1;
h1 = h3;
}
return head;
}
};
效率: