链表看这一篇就够了

最新推荐文章于 2024-09-15 11:40:06 发布

Hanknet

最新推荐文章于 2024-09-15 11:40:06 发布

阅读量53

点赞数

分类专栏： leetCode 文章标签： c++ 链表 Powered by 金山文档

本文链接：https://blog.csdn.net/Hanknet/article/details/128686516

版权

leetCode 专栏收录该内容

50 篇文章 0 订阅

订阅专栏

本文介绍了四种基于链表的算法问题解决方案，包括使用双指针找到链表相交的节点、删除链表的倒数第N个节点、两两交换链表中的节点以及检测环形链表。所有方法的时间复杂度都在O(n)级别，空间复杂度为O(1)，展示了高效的空间效率。

摘要由CSDN通过智能技术生成

面试题 02.07. 链表相交

class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        ListNode* cur1 = headA;
        ListNode* cur2 = headB;
        int len1 = 0, len2 = 0;
        while(cur1 != NULL) {
            cur1 = cur1->next;
            ++len1;
        }

        while(cur2 != NULL) {
            cur2 = cur2->next;
            ++len2;
        }

        cur1 = headA, cur2 = headB;
        if(len2 > len1) {
            swap(len1, len2);
            swap(cur1, cur2);
        }
        int gap = len1 - len2;
        while(gap--) cur1 = cur1->next;

        while(cur1 != NULL) {
            if(cur1 == cur2) return cur1;
            cur1 = cur1->next;
            cur2 = cur2->next;
        }            
        
        return 0;
    }
};

方法：双指针(快慢指针)

$时间复杂度O(n+m), 空间复杂度O(1)

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 != NULL) fast = fast->next;
        fast = fast->next;
        while(fast) {
            fast = fast->next;
            slow = slow->next;
        }
        slow->next = slow->next->next;
        head = dummyHead->next;
        delete dummyHead;
        return head;
    }
};

方法：双指针(快慢指针)

$时间复杂度O(n), 空间复杂度O(1)

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

class Solution {
public:
    ListNode* swapPairs(ListNode* head) {
        ListNode* dummyHead = new ListNode(0);
        dummyHead->next = head;
        ListNode* cur = dummyHead;
        while(cur->next && cur->next->next) {
            ListNode* tmp = cur->next;
            ListNode* tmp1 = cur->next->next->next;

            cur->next = cur->next->next;
            cur->next->next = tmp;
            cur->next->next->next = tmp1;

            cur = cur->next->next;
        }
        head = dummyHead->next;
        delete dummyHead;
        return head;
    }
};

$时间复杂度O(n), 空间复杂度O(1)

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

方法：双指针(快慢指针)

$时间复杂度O(n), 空间复杂度O(1)