题目
给你一个链表,两两交换其中相邻的节点,并返回交换后链表的头节点。你必须在不修改节点内部的值的情况下完成本题(即,只能进行节点交换)。
输入:head = [1,2,3,4]
输出:[2,1,4,3]
思路
依旧双指针,有手就行
代码
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* swapPairs(ListNode* head)
{
if(head == nullptr || head->next == nullptr)
return head;
ListNode* dummyNode = new ListNode(-1);
dummyNode->next = head;
ListNode* pre = dummyNode;
ListNode* p = dummyNode->next;
ListNode* q = dummyNode->next->next;
while(p!= nullptr && q!=nullptr)
{
pre->next = q;
ListNode* c = q->next;
q->next = p;
p->next = c;
if(c==nullptr || (c!=nullptr&&c->next==nullptr))
break;
pre = p;
p = c;
q = c->next;
}
ListNode* resNode =dummyNode->next;
delete dummyNode;
return resNode;
}
};