LeetCode 24. Swap Nodes in Pairs

最新推荐文章于 2024-07-26 10:48:09 发布

David_DLUT

最新推荐文章于 2024-07-26 10:48:09 发布

阅读量194

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/David_DLUT/article/details/53941583

版权

LeetCode 专栏收录该内容

42 篇文章

订阅专栏

本文介绍了一种算法，该算法能在常数空间内交换给定链表中的每两个相邻节点，例如将1->2->3->4转换为2->1->4->3。文章详细解释了如何仅通过改变节点指针来实现这一操作，而不修改节点中的实际值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a linked list, swap every two adjacent nodes and return its head.

For example,
Given 1->2->3->4, you should return the list as 2->1->4->3.

Your algorithm should use only constant space. You may not modify the values in the list, only nodes itself can be changed.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* swapPairs(ListNode* head) {
        ListNode headNode(0);
        ListNode* preTail = &headNode;
        ListNode* nextHead = head;
        while (true) {
            if ((nextHead == NULL) || (nextHead->next == NULL)) {
                preTail->next = nextHead;
                return headNode.next;
            }
            ListNode* temp = nextHead->next->next;
            preTail->next = nextHead->next;
            nextHead->next->next = nextHead;
            preTail = nextHead;
            nextHead = temp;
        }
    }
};