[LeetCode] Intersection of Two Linked Lists

Write a program to find the node at which the intersection of two singly linked lists begins.


For example, the following two linked lists:

A:          a1 → a2
                   ↘
                     c1 → c2 → c3
                   ↗            
B:     b1 → b2 → b3

begin to intersect at node c1.


Notes:

  • If the two linked lists have no intersection at all, return null.
  • The linked lists must retain their original structure after the function returns.
  • You may assume there are no cycles anywhere in the entire linked structure.
  • Your code should preferably run in O(n) time and use only O(1) memory.

 

Credits:
Special thanks to @stellari for adding this problem and creating all test cases.

 

Hide Tags
 Linked List
 
 
分析:
 
如果两个链表相交,那么后面的链表必然相同,找到lenA,lenB,然后跳过lenA和lenB的差,
然后比较两个指针是否相同,若相同则有交叉,同时找到交叉节点,否则就是没有交叉。
 
复制代码
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
    public:
        ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
            if(headA == NULL || headB == NULL)
                return NULL;
            int lenA = 0;
            int lenB = 0;

            ListNode* pA = headA;
            ListNode* pB = headB;

            while(pA)
            {   
                lenA ++; 
                pA = pA->next;
            }   

            while(pB)
            {   
                lenB ++; 
                pB = pB->next;
            }   

            if(lenA > lenB)
            {   
                for(int i = 0; i < (lenA-lenB); i++)
                    headA = headA->next;
            }   
            else if(lenA < lenB)
            {   
                for(int i = 0; i < (lenB-lenA); i++)
                    headB = headB->next;
            }

            while(headA != headB)
            {
                    headA = headA->next;
                    headB = headB->next;
            }
            if(headA == headB)
                return headA;
            else
                return NULL;
        }
};
复制代码

 

posted @   穆穆兔兔  阅读(164)  评论(0编辑  收藏  举报
编辑推荐:
· Linux glibc自带哈希表的用例及性能测试
· 深入理解 Mybatis 分库分表执行原理
· 如何打造一个高并发系统?
· .NET Core GC压缩(compact_phase)底层原理浅谈
· 现代计算机视觉入门之:什么是图片特征编码
阅读排行:
· 手把手教你在本地部署DeepSeek R1,搭建web-ui ,建议收藏!
· Spring AI + Ollama 实现 deepseek-r1 的API服务和调用
· 数据库服务器 SQL Server 版本升级公告
· 程序员常用高效实用工具推荐,办公效率提升利器!
· C#/.NET/.NET Core技术前沿周刊 | 第 23 期(2025年1.20-1.26)
点击右上角即可分享
微信分享提示