代码随想录DAY4：两两交换链表中的节点 + 删除链表的倒数第N个节点 + 链表相交 + 环形链表-CSDN博客

本文链接：https://blog.csdn.net/y_duan/article/details/138765441

1. 两两交换链表中的节点

class Solution {
public:
    ListNode* swapPairs(ListNode* head) {
        ListNode *dummynode = new ListNode(0);
        dummynode->next = head;
        ListNode *cur = dummynode;
        while (cur->next != nullptr && cur->next->next != nullptr) {
            ListNode *tmp = cur->next->next->next;
            ListNode *tmp1 = cur->next;
            cur->next = cur->next->next;
            cur->next->next = tmp1;
            cur->next->next->next = tmp;

            cur = cur->next->next;

        }
        ListNode *result = dummynode->next;
        delete dummynode;
        return result;
    }
};

2. 删除链表的倒数第N个节点

class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        ListNode* dummyhead = new ListNode(0);
        dummyhead->next = head;
        ListNode* fast = dummyhead;
        ListNode* slow = dummyhead;
        while(n--&&fast!=nullptr){
            fast = fast->next;
        }
        fast=fast->next;
        while(fast){
            slow=slow->next;
            fast=fast->next;
        }
        slow->next=slow->next->next;
        return dummyhead->next;
    }
};

3. 链表相交

class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        ListNode* curA = headA;
        ListNode* curB = headB;
        int lenA=0,lenB=0;
        while(curA){
            lenA++;
            curA=curA->next;
        }
        while(curB){
            lenB++;
            curB=curB->next;
        }
        curA = headA;
        curB = headB;

        if(lenB>lenA){
            swap(lenA,lenB);
            swap(curA,curB);
        }
        int dlen=lenA-lenB;
        while(dlen--){
            curA=curA->next;
        }
        while(curA){
            if(curA==curB){
                return curA;
            }
            curA=curA->next;
            curB=curB->next;
        }
        return NULL;
    }
};

4. 环形链表

class Solution {
public:
    ListNode *detectCycle(ListNode *head) {
        ListNode* fast = head;
        ListNode* slow = head;
        while(fast&&fast->next){
            fast=fast->next->next;
            slow=slow->next;
            if(fast==slow){
                ListNode* index1 = fast;
                ListNode* index2 = head;
                while(index1!=index2){
                    index1 = index1->next;
                    index2 = index2->next;
                }
                return index2;
            }
        }
        return NULL;
    }
};