数据结构-链表

leetcode141. 环形链表

解题重点：
1.快慢指针，问题转化为追及问题

class Solution: 
	def hasCycle(self, head: ListNode) -> bool: 
		if not head: 
			return False 
		slow,fast = head,head 
		while fast and fast.next: 
			slow = slow.next 
			fast = fast.next.next 
			if slow and slow == fast:return True 
		return False

leetcode142. 环形链表 II

解题重点：
1.根据快慢指针2倍关系特点，推算出链表入环点距离
2.没有办法直接判断a=c距离，需要找关系！
3. 定义指针时，如果没办法两指针定义在一个结点上，要注意相遇的位置！

class Solution: 
	def detectCycle(self, head: ListNode) -> ListNode: 
		if not head: 
			return None 
		slow,fast,start = head,head,head 
		while fast and fast.next: 
			slow = slow.next 
			fast = fast.next.next 
			if slow and slow == fast: 
				while slow != start: 
					slow = slow.next 
					start = start.next 
				return slow 
		return None