代码随想录算法训练营第四天|leetcode19、24、02.07、142题

leetcode第24题​​​​​​

struct ListNode* swapPairs(struct ListNode* head) 
{
    struct ListNode dummy;
    dummy.next = head;
    struct ListNode* current = head;
    struct ListNode* prev = &dummy;

    while (current && current->next) 
    {
        struct ListNode* L = current->next;
        current->next = L->next;
        L->next = current;
        prev->next = L;

        prev = current;
        current = current->next;
    }
    return dummy.next;
}

leetcode第19题

struct ListNode* swapPairs(struct ListNode* head) 
{
    struct ListNode dummy;
    dummy.next = head;
    struct ListNode* current = head;
    struct ListNode* prev = &dummy;

    while (current && current->next) 
    {
        struct ListNode* L = current->next;
        current->next = L->next;
        L->next = current;
        prev->next = L;

        prev = current;
        current = current->next;
    }
    return dummy.next;
}

leetcode面试题02.07

int getLength(struct ListNode* l) {
    int count = 0;
    while (l != NULL) {
        ++count;
        l = l->next;
    }
    return count;
}
struct ListNode* getIntersectionNode(struct ListNode* headA,
                                     struct ListNode* headB) {
    typedef struct ListNode ListNode;
    ListNode *p, *q;
    int a = getLength(headA), b = getLength(headB);
    for (p = headB; a < b; b--)
        p = p->next;
    for (q = headA; a > b; a--)
        q = q->next;
    while(p!=NULL&&p!=q){
        p=p->next;
        q=q->next;
    }
    return p;
}

leetcode第142题

struct ListNode *detectCycle(struct ListNode *head) {
        if(head==NULL)
        return false;
    struct ListNode *fast=head,*slow=head;
    while(fast&&fast->next)
    {
        fast=fast->next->next;
        slow=slow->next;
        if(fast==slow)
        {
            fast=head;
            while(1)
            {
                if(fast==slow)
                {
                    return fast;
                }
                fast=fast->next;
                slow=slow->next;
            }
        }
    }
    return NULL;
}