给你一个链表,两两交换其中相邻的节点,并返回交换后链表的头节点。你必须在不修改节点内部的值的情况下完成本题(即,只能进行节点交换)。
示例 1:
输入:head = [1,2,3,4] 输出:[2,1,4,3]
示例 2:
输入:head = [] 输出:[]
示例 3:
输入:head = [1] 输出:[1]
思路
遍历交换;递归
代码
递归
class Solution {
public:
ListNode* swapPairs(ListNode* head) {
if(!head ||!head->next)
return head;
ListNode* tmp = head->next;
head->next = swapPairs(tmp->next);
tmp->next = head;
return tmp;
}
};
遍历
class Solution {
public:
ListNode* swapPairs(ListNode* head) {
ListNode* nodeheap = new ListNode(-1, head);
ListNode* node = nodeheap;
ListNode* res = node;
if(head == nullptr)
return head;
if(!head->next)
return head;
while(node && node->next && node->next->next)
{
ListNode* second = node->next->next;
ListNode* first = node->next;
node->next = second;
first->next = second->next;
second->next = first;
node = first;
}
res = res->next;
delete nodeheap;
return res;
}
};