代码随想录算法训练营第四天|● 24. 两两交换链表中的节点 ● 19.删除链表的倒数第N个节点 ● 面试题 02.07. 链表相交 ● 142.环形链表II

题目链接：● 24. 两两交换链表中的节点 ● 19.删除链表的倒数第N个节点 ● 面试题 02.07. 链表相交 ● 142.环形链表II 

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

/**
 * 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 *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;
            tmp->next =tmp1;

            cur = cur->next->next;
        }
        return dummyHead->next;
    }
};

今天开头是一题比较简单的题，最重要的是弄清楚循环的终止条件。

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

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

        return dummyHead->next;
    }
};

        这题的重点是双指针的指向，慢指针必须指向被删除节点的前一个节点才能操作。

3、面试题 02.07

class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        ListNode *curA = headA;
        ListNode *curB = headB;
        int LenA = 0,LenB = 0;
        while(curA != NULL){
            LenA++;
            curA = curA->next;
        }//求a的长度
        while(curB != NULL){
            LenB++;
            curB = curB->next;
        }//求b的长度
        curA =headA;
        curB =headB;
        if(LenB > LenA){
            swap(LenA,LenB);
            swap(curA,curB);
        }
        int gap = LenA - LenB;
        while(gap--){
            curA = curA->next;
        }
        while(curA != NULL){
            if(curA == curB){
                return curA;
            }
            curA = curA->next;
            curB = curB->next;
        }
        return NULL;
    }
};

        我认为难点是IF语句上。如果链表B的长度大于链表A的长度，交换两个链表的长度和头节点指针，保证`curA`总是指向较长的链表。

4、142.环形链表II

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *detectCycle(ListNode *head) {
        ListNode *fast = head;
        ListNode *slow = head;
        while(fast != NULL&& fast->next != NULL){
            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 index1;
            }
        }
        return NULL;
    }
};

        这题有点像是小学学的追及问题，代码不难主要是弄懂快慢指针的相遇问题。