class Solution:
def EntryNodeOfLoop(self, pHead):
# write code here
#思路:存储每一个访问的节点,一旦下一节点与存储的节点相同,则意味着下一节点是环的入口
if not pHead:
return None
dic={}
dic[pHead]=0
while pHead.next:
if dic.__contains__(pHead.next):
return pHead.next
dic[pHead.next]=0
pHead=pHead.next
return None