Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Merge 28bfb0c2a5eaf33f4300f63b465cea93ae61b6e5 into b70121d377cb6005eb65f12b098cd5decd905669

Browse Source
This commit is contained in:
Haoping 2023-09-06 06:09:39 +08:00 committed by GitHub
commit c5b0b53a67
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
notes/Leetcode 题解 - 链表.md
View File

@ -66,7 +66,7 @@ public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
如果只是判断是否存在交点，那么就是另一个问题，即 [编程之美 3.6]() 的问题。有两种解法：
- 把第一个链表的结尾连接到第二个链表的开头，看第二个链表是否存在环；
- 或者直接比较两个链表的最后一个节点是否相同。
- 或者直接比较两个链表的最后一个节点是否相同。遍历两个链表，同时记录长度len1和len2，让长链表先走abs(len2-len1)步，再一起走至相同节点。
## 2. 链表反转