160【LeetCode】Intersection of Two Linked Lists

yukigenius

于 2015-04-04 09:11:07 发布

阅读量182

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode Java 文章标签： Java LeetCode algorithm

本文链接：https://blog.youkuaiyun.com/yukigenius/article/details/44870849

174 篇文章

订阅专栏

174 篇文章

订阅专栏

本文介绍了一种算法，用于找出两个单链表开始相交的节点。若链表无交点则返回空。该方法需保持原链表结构不变，并倾向于使用O(n)的时间复杂度与O(1)的空间复杂度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

{优快云:CODE:635811}