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

Merge pull request #873 from sugarlesss/master

Browse Source 
更新 面试题02.07.链表相交 错别字勘误
This commit is contained in:
程序员Carl
2021-10-29 09:26:47 +08:00
committed by GitHub
parent 5e7a5fc8a7 825600a1d2
commit 0df880fa71
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -38,7 +38,7 @@
![面试题02.07.链表相交_2](https://code-thinking.cdn.bcebos.com/pics/面试题02.07.链表相交_2.png)
此时我们就可以比较curA和curB是否相同，如果不相同，同时向后移动curA和curB，如果遇到curA == curB，则找到焦点。
此时我们就可以比较curA和curB是否相同，如果不相同，同时向后移动curA和curB，如果遇到curA == curB，则找到交点。
否则循环退出返回空指针。