给你一个链表,两两交换其中相邻的节点,并返回交换后链表的头节点。你必须在不修改节点内部的值的情况下完成本题(即,只能进行节点交换)。
示例 1:
输入:head = [1,2,3,4] 输出:[2,1,4,3]
示例 2:
输入:head = [] 输出:[]
示例 3:
输入:head = [1] 输出:[1]
提示:
- 链表中节点的数目在范围
[0, 100]
内 0 <= Node.val <= 100
/**
* 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) {
//创建一个虚拟节点
ListNode* ans = new ListNode();
ans->next = head;
ListNode* pre = ans;
while(pre->next && pre->next->next){
//两个需要交换的节点
ListNode* first = pre->next;
ListNode* second = pre->next->next;
first->next = second->next;
second->next = first;
//替换头指针的位置
pre->next = second;
pre = first;
}
return ans->next;
}
};
//下面是给出了主函数进行测试
// 辅助函数:打印链表
void printList(ListNode* head) {
ListNode* current = head;
while (current != nullptr) {
std::cout << current->val << " ";
current = current->next;
}
std::cout << std::endl;
}
int main() {
// 创建链表 1->2->3->4
ListNode* head = new ListNode(1);
head->next = new ListNode(2);
head->next->next = new ListNode(3);
head->next->next->next = new ListNode(4);
// 交换节点
Solution solution;
ListNode* newHead = solution.swapPairs(head);
// 打印结果
printList(newHead);
// 释放链表内存
ListNode* current = newHead;
while (current != nullptr) {
ListNode* next = current->next;
delete current;
current = next;
}
return 0;
}