Given a linked list, swap every two adjacent nodes and return its head.
For example,
Given1->2->3->4, you should return the list as2->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.
参考的别人的方法,递归调用
代码:
/**
* 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==NULL || head->next==NULL)
return head;
//只有两个结点时
if(head->next->next==NULL){
ListNode *pNext = head->next;
pNext->next = head;
head->next = NULL;
return pNext;
}
//多个结点,递归调用
else{
ListNode *pNext = head->next;
ListNode *newHead = pNext->next;
pNext->next = head;
head->next = swapPairs(newHead);
return pNext;
}
}
};