[LeetCode]--160. Intersection of Two Linked Lists

杜鲁门

于 2016-10-06 16:08:18 发布

阅读量739

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode LeetCode算法分析文章标签： leetcode 链表相同尾部算法链表遍历算法算法遍历

本文链接：https://blog.youkuaiyun.com/bug_moving/article/details/52743975

LeetCode算法分析同时被 2 个专栏收录

115 篇文章 ¥9.90 ¥99.00

订阅专栏

LeetCode

126 篇文章

订阅专栏

该程序旨在找到两个单链表的交点。如果无交点，则返回null。算法思路包括：计算长度差并同步移动，链表尾部跳转至另一链表头部等方法。所有解法都保留链表原始结构，且要求时间复杂度为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.

因为受上面一个问题影

了解本专栏