代码随想录算法训练营Day4 24. 两两交换链表中的节点 19.删除链表的倒数第N个节点 160. 链表相交 142.环形链表II

目录

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

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

160. 链表相交

142.环形链表II

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

class Solution {
public:
    ListNode* swapPairs(ListNode* head) {
        ListNode* dummyhead = new ListNode(0);
        dummyhead->next = head;//虚拟头指针，指向head
        ListNode* currentp = dummyhead;

        while(currentp->next != NULL && currentp->next->next != NULL){
            ListNode* tmp = currentp->next;
            ListNode* tmp1 = currentp->next->next->next;

            currentp->next = currentp->next->next;
            currentp->next->next = tmp;
            tmp->next = tmp1;

            currentp = currentp->next->next;
    }
};

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

class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        int len = 0;//记录链表的长度
        ListNode* virhead = new ListNode(0);//设置一个头指针，方便操作
        virhead->next = head;
        ListNode* tmp = virhead;//帮忙计算链表长度

        //while计算链表长度
        while(tmp->next != NULL){
            tmp = tmp->next;
            len++;
        }

        ListNode* p = virhead;//这个指针到我们要删除的节点的前一个，开始删除

        for(int i = 0; i < len - n; i++){
            p = p->next;
        }

        ListNode* delp = NULL;
        //一顿循环后p指针会到我们要删除的前一位
        if(p->next->next != NULL){//如果删除的不是最后一位
            delp = p->next;
            p->next = p->next->next;
            //delete delp;
        }else{
            p->next = NULL;
        }

        return virhead->next;

    }
};

160. 链表相交

class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        ListNode* pa = headA;//设置头指针指向a
        ListNode* pb = headB;//设置头指针指向b
        int lenA = 0;//记录链表a的长度
        int lenB = 0;//记录链表b的长度
        int num = 0;//用来记录两条链表的差值

        while(pa != NULL){//循环遍历链表a
            pa = pa->next;
            ++lenA;
        }

        while(pb != NULL){//循环遍历链表b
            pb = pb->next;
            ++lenB;
        }

        num = lenA - lenB;//记录长度差
        pa = headA;//重新让两个指针指向头指针
        pb = headB;

        if(num > 0){//链表a比b长
            for(int i = 0; i < num; i++){
                pa = pa->next;
            }
            while(pa != NULL && pb != NULL && pa != pb){//如果这两个指针一直不相等就一直遍历下去
                pa = pa->next;
                pb = pb->next;
            }
            return pb;

        }else if(num < 0){//链表b比a长
            num = -num;
             for(int i = 0; i < num; i++){
                pb = pb->next;
            }
            while(pa != NULL && pb != NULL && pa != pb){//如果这两个指针一直不相等就一直遍历下去
                pa = pa->next;
                pb = pb->next;
            }
            return pa;

        }else{//两条链表一样长
             while(pa != NULL && pb != NULL && pa != pb){//如果这两个指针一直不相等就一直遍历下去
                pa = pa->next;
                pb = pb->next;
            }
            return pa;
        }

        return NULL;

    }
};

142.环形链表II

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

        return NULL;
    }
};