# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def getIntersectionNode(self, headA, headB):
if headA == None or headB == None:
return None
indexA=headA
indexB=headB
while indexA!=indexB:
if indexA:
indexA=indexA.next
else:
indexA=headB
if indexB:
indexB=indexB.next
else:
indexB=headA
return indexA