LeetCode暑期刷题打卡 ---链表专题day3

最新推荐文章于 2024-07-21 15:36:00 发布

chstor

最新推荐文章于 2024-07-21 15:36:00 发布

阅读量115

点赞数

文章标签：链表 leetcode 数据结构

本文链接：https://blog.csdn.net/weixin_45821690/article/details/130143324

版权

92. 反转链表 II

在这里插入图片描述

    ListNode* reverseBetween(ListNode* head, int l, int r) {
        if(l == r) return head;
        auto dummy = new ListNode(-1);
        dummy->next = head;
        auto a = dummy,b = dummy;
        for(int i = 0; i < l - 1; i ++) a = a->next;
        for(int i = 0; i < r; i ++ ) b = b->next; 
        auto c = a->next, d = b->next;
        for(auto p = c,q = c->next;q != d;){
            auto o = q->next;
            q->next = p;
            p = q,q = o;
        }
        a->next = b;
        c->next = d;
        return dummy->next;
    }

160. 相交链表

在这里插入图片描述

ListNode *getIntersectionNode(ListNode *h1, ListNode *h2) {
        auto p = h1,q = h2;
        while(p != q){
            if(p) p = p->next;
            else p = h2;
            if(q) q = q->next;
            else q = h1;
        }
        return p;
    }

142. 环形链表 II

在这里插入图片描述

    ListNode *detectCycle(ListNode *head) {
        auto fast = head,slow = head;
        while(fast){
            fast = fast->next;
            slow = slow->next;
            if(fast) fast = fast->next;
            else break;
            if(fast == slow){
                fast = head;
                while(fast != slow){
                    fast = fast->next;
                    slow = slow->next;
                }
                return fast;
            }
        }
        return NULL;
    }