LeetCode 24. 两两交换链表中的节点
思路
采用模拟法(创建一个虚拟头结点dummyHead(方便后续操作))
Step1.当前指针cur->next指向cur->next->next结点
Step2.将cur->next->next指向原链表的cur->next结点(需要提前保存一下)
Step3.将cur->next->next->next指向原链表的cur->next->next->next结点(需要提前保存一下)
Step4.将cur结点向后移动2个结点的位置
Step5.循环上述操作,直到cur的下一个结点为空并且下下个结点也为空,则退出循环,返回dummyHead->next
代码
class Solution {
public:
ListNode* swapPairs(ListNode* head) {
ListNode *dummyHead = new ListNode(0);
dummyHead->next = head;
ListNode *cur = dummyHead;
while(cur->next != nullptr && cur->next->next != nullptr){
ListNode *tmp1 = cur->next;
ListNode *tmp2 = cur->next->next->next;
cur->next = cur->next->next;
cur->next->next = tmp1;
cur->next->next->next = tmp2;
cur = cur->next->next;
}
head = dummyHead->next;
delete dummyHead;
return head;
}
};