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.
算法:这个问题我们可以使用递归的思想来求解,首先把前两个交换,然后再返回从第三个节点开始的链表。不过这里要注意的是,必须先把head->next的下一个节点绑定在递归函数上,因为如果先head绑定在head->next的话会导致head->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 == NULL || head->next == NULL){
return head;
}
else{
ListNode *n = head->next;
head->next = swapPairs(head->next->next);
n->next = head;
return n;
}
}
};
复杂度: O(n)