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.
给定一个链表,交换两个相邻节点并返回链表头结点。不能修改链表里节点的值,只能改变节点的指向。
解答分析:
(1)每两个节点为一组,改变节点指向,由正序变为逆序,例如 1->2变为2->1;
(2)采用递归,每次递归改变一组节点指向,并与上一组节点连接。
运行时间 4 ms,代码如下:
class Solution {
public:
ListNode* swapPairs(ListNode* head) {
ListNode *p, *q, *h;
if(!head || !head->next)
return head;
q=head;
head=head->next;
p=head->next;
h=swapPairs(p);
head->next=q;
q->next=h;
return head;
}
};