Commit ba31161

authored

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

1 parent 87abfa1 commit ba31161Copy full SHA for ba31161

File tree

-0

lines changed

-0

lines changed

Lines changed: 2 additions & 0 deletions

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

Comments

(0)