DMSXL刷题（1）24 19 02.07 142

题号：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* fast=dummyhead;
        ListNode* slow=dummyhead;
        while(n--&&fast!=nullptr)
        {
            fast=fast->next;
        }
        fast=fast->next;

        while(fast!=nullptr)
        {
            slow=slow->next;
            fast=fast->next;         
        }
         ListNode *tmp = slow->next;  
         slow->next = tmp->next;
        delete tmp;

        return dummyhead->next;
    }
};

面试题 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;
        }
        while(curB!=NULL)
        {
            lenB++;
            curB=curB->next;
        }
        //保证curA为最长链表的头，lenA为长度
        if(lenB>lenA)
        {
            swap(headA,headB);
            swap(lenA,lenB);
        }
        
        int n=lenA-lenB;

        //初始化curA curB
        curA = headA;
        curB = headB;

        //让curA curB在同一起点（末尾对齐）
        while(n--)
        {
            curA=curA->next;
        }
        while(curA!=NULL)
        {
            if(curA==curB)
            {
                return curA;
            }
            curA=curA->next;
            curB=curB->next;
        }
        return NULL;
    }
};

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* same1=fast;
                ListNode* same2=head;
                while(same1!=same2)
                {
                    same1=same1->next;
                    same2=same2->next;
                }
                return same1;
            }
        }
        return NULL;
    }
};