题目描述:
给你一个链表,两两交换其中相邻的节点,并返回交换后链表的头节点。你必须在不修改节点内部的值的情况下完成本题(即,只能进行节点交换)。
例 1:
输入:head = [1,2,3,4] 输出:[2,1,4,3]
示例 2:
输入:head = [] 输出:[]
示例 3:
输入:head = [1] 输出:[1]
题目链接:
题目主要思路:
借助哨兵节点,模拟交换过程即可。
解题代码:
/**
* 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* newHead = new ListNode(0);
newHead->next = head;
ListNode* tail = newHead, *cur1 = tail->next, *cur2 = cur1->next, *next = cur2->next;
while (cur1 && cur2) {
// 交换
tail->next = cur2;
cur2->next = cur1;
cur1->next = next;
// 修改指针
tail = cur1;
if (tail) cur1 = tail->next;
if (cur1) cur2 = cur1->next;
if (cur2) next = cur2->next;
}
head = newHead->next;
delete newHead;
return head;
}
};