代码算法训练第五天 |24. 两两交换链表中的节点 删除链表的倒数第N个节点 142.环形链表II

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

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* tmp1=cur->next;
        ListNode* tmp2=cur->next->next->next;
        cur->next=cur->next->next;
        cur->next->next=tmp1;
        cur->next->next->next=tmp2;
        cur=cur->next->next;
       }
       return dummyhead->next;
    }
};

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

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

142.环形链表II 

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(slow==fast)
        {
            ListNode* index1=fast;
            ListNode* index2=head;
            if(index1!=index2)
            {
                index1=index1->next;
                index2=index2->next;
            }
            return index1;
        }
       }
       return NULL;
    }
};