代码随想录算法训练营day4|24.两两交换链表中的结点 19.删除链表的倒数第N个结点 面试题 02.07.链表香蕉 142.环形链表Ⅱ

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

思路如图：需要注意的是，要记录2和3两个位置，防止断链儿

ListNode* swapPairs(ListNode* head) {
    ListNode* dummyhead = new ListNode(0);
    dummyhead->next = head;
    ListNode* cur = dummyhead;
    while(cur->next != nullptr && cur->next->next != nullptr){
        ListNode* tmp = cur->next;
        ListNode* tmp1 = cur->next->next->next;
        cur->next = cur->next->next;
        cur->next->next = tmp;
        cur->next->next->next = tmp1;
        cur = cur->next->next;
    }
    return dummyhead->next;
}

19.删除链表的倒数第N个结点

思路：快慢指针，fast和slow，fast先移动N+1次，然后fast和slow同时移动，直到，fast移动到最后一个结点，此时slow指向的结点为倒数第N个结点

ListNode* removeNthFromEnd(ListNode* head, int n) {
    ListNode* dummyhead = new ListNode(0);//设置虚拟头结点
    dummyhead->next = head;
    ListNode* fast = dummyhead;
    ListNode* slow = dummyhead;
    fast -> next = head;
    while(n-- && fast != NULL){
        fast = fast->next;
    }
    fast = fast->next;
    while(fast != NULL){
        fast = fast->next;
        slow = slow->next;
    }
    slow->next = slow->next->next;
    return dummyhead->next; 
}

面试题 02.07.链表相交

思路：求链表A和B的长度，计算长度差，让两个链表起步位置相同，然后同时移动，遇到相同指针直接返回

ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
    ListNode* curA = headA;
    ListNode* curB = headB;
    int lenA = 0,lenB = 0;
    while(curA != NULL){
        lenA++;
        curA = curA->next;
    }
    while(curB != NULL){
        lenB++;
        curB = curB->next;
    }
    curA = headA;
    curB = headB;
    if(lenB > lenA){
        swap(lenB,lenA);
        swap(curB,curA);
    }
    int gap = lenA - lenB;
    while(gap--){
        curA = curA->next;
    }
    while(curA!=NULL){
        if(curA == curB){//注：判定条件是指针相同，不是val相同
            return curA;
        }
        curA = curA->next;
        curB = curB->next;
    }
    return NULL;
}

142.环形链表Ⅱ

思路：快慢指针，fast每次移动两个，slow每次移动一个，如果fast追上slow，表示有环

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