LC 160. Intersection of Two Linked Lists
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
| /**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} headA
* @param {ListNode} headB
* @return {ListNode}
*/
var getIntersectionNode = function(headA, headB) {
const visited = new Set()
let temp = headA
while (temp !== null) {
visited.add(temp)
temp = temp.next
}
temp = headB
while (temp !== null) {
if (visited.has(temp)) {
return temp
}
temp = temp.next
}
return null
};
|
评论和交流请发送邮件到 me@tianhegao.com