-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path_160_intersectionList.py
More file actions
66 lines (46 loc) · 1.33 KB
/
_160_intersectionList.py
File metadata and controls
66 lines (46 loc) · 1.33 KB
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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def getIntersectionNode(self, headA: ListNode, headB: ListNode) -> ListNode:
if not headA or not headB:
return
ha=headA
hb=headB
countA=0
countB=0
while ha.next:
ha=ha.next
countA+=1
while hb.next:
hb=hb.next
countB+=1
if countA-countB>=0:
ha=headA
x=0
while 1:
if x==countA-countB:
break
else:
ha=ha.next
x+=1
hb=headB
else:
hb=headB
x=0
while 1:
if x==countB-countA:
break
else:
hb=hb.next
x+=1
ha=headA
while 1:
if hb==ha:
break
else:
hb=hb.next
ha=ha.next
return ha