algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-10 12:15:58 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 面试题02.07.链表相交.md

Browse Source
This commit is contained in:
JaneyLin
2022-06-08 17:47:49 -05:00
committed by GitHub
parent 87abfa1664
commit ba31161609
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/面试题02.07.链表相交.md
View File

@ -160,6 +160,8 @@ class Solution:
那么，只要其中一个链表走完了，就去走另一条链表的路。如果有交点，他们最终一定会在同一个 那么，只要其中一个链表走完了，就去走另一条链表的路。如果有交点，他们最终一定会在同一个
位置相遇 位置相遇
""" """
if headA is None or headB is None:
return None
cur_a, cur_b = headA, headB # 用两个指针代替a和b cur_a, cur_b = headA, headB # 用两个指针代替a和b