LeetCode 24. 两两交换链表中的节点

最新推荐文章于 2022-10-19 09:14:58 发布

tomjobs

最新推荐文章于 2022-10-19 09:14:58 发布

阅读量113

点赞数

分类专栏： # leetcode # 链表

本文链接：https://blog.csdn.net/tomjobs/article/details/112790410

版权

leetcode 同时被 2 个专栏收录

112 篇文章 0 订阅

订阅专栏

链表

16 篇文章 0 订阅

订阅专栏

在这里插入图片描述

/**
 * 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 == NULL || head -> next == NULL) return head; //0个节点和1个节点直接返回
        ListNode* h = new ListNode();
        h -> next = head;
        ListNode* ans = h;
        ListNode*l1 = h -> next;
        ListNode*l2 = h -> next -> next;
        int cnt = 0;
        while(true) {
            h -> next = l2;
            ListNode*tmp = l2 -> next;
            h -> next = l2;
            l2 -> next = l1;
            l1 -> next = tmp;
            l1 = h -> next;
            l2 = h -> next -> next;
            if(l2 -> next == NULL || l2 -> next -> next == NULL) break;
            h = h -> next -> next;
            l1 = l1 -> next -> next;
            l2 = l2 -> next -> next;
        }
        return ans -> next;
    }
};