class ListNode(object):
def __init__(self,x):
self.val = x
self.next = None
class Solution(object):
def getIntersectionNode(self,headA,headB):
p1 = headA
p2 = headB
while p1 !=p2:
if not p1:
p1 = headB
else:
p1 = p1.next
if not p2:
p2 =headA
else:
p2 = p2.next
#只要两个链表都走过的话,走过的长度是一定相同的