题目:
给一个链表,若其中包含环,请找出该链表的环的入口结点,否则,输出null。
思路一:
暴力解法
代码:
class Solution:
def EntryNodeOfLoop(self, pHead):
arr = []
while pHead:
arr.append(pHead)
pHead = pHead.next
if pHead in arr: return pHead
return None
思路二:
双指针
代码:
class Solution:
def EntryNodeOfLoop(self, pHead):
if pHead.next: p1, p2 = pHead.next.next, pHead.next
else: return None
while p1 != p2:
if p1 == None: return None
p1 = p1.next.next
p2 = p2.next
p1 = pHead
while p1 != p2:
p1 = p1.next
p2 = p2.next
return p1